Pages that link to "Item:Q1278125"

The following pages link to Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125):

Displaying 32 items.

• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
• A multi-shift vehicle routing problem with windows and cycle times (Q360503) (← links)
• Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
• A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
• Rule-based scheduling in wafer fabrication with due date-based objectives (Q1761232) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic (Q1848643) (← links)
• A crane scheduling method for port container terminals (Q1877918) (← links)
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
• Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
• Optimal collection of medical specimens and delivery to central laboratory (Q2178326) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times (Q2669803) (← links)
• A rework-based dispatching algorithm for module process in TFT-LCD manufacture (Q3163752) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
• Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
• Parallel machine scheduling considering a job-splitting property (Q4671338) (← links)
• Heuristics for minimizing total weighted tardiness in complex job shops (Q4681151) (← links)
• Greedy solutions of selection and ordering problems (Q5945209) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• Learning-augmented heuristics for scheduling parallel serial-batch processing machines (Q6164322) (← links)
• A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem (Q6588489) (← links)
• Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens (Q6609700) (← links)