Scheduling jobs on parallel machines with sequence-dependent setup times
From MaRDI portal
Publication:1278125
DOI10.1016/S0377-2217(95)00376-2zbMath0917.90193OpenAlexW2034801210MaRDI QIDQ1278125
Young Hoon Lee, Michael L. Pinedo
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(95)00376-2
Related Items
A crane scheduling method for port container terminals ⋮ A rework-based dispatching algorithm for module process in TFT-LCD manufacture ⋮ Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ A multi-shift vehicle routing problem with windows and cycle times ⋮ Optimal collection of medical specimens and delivery to central laboratory ⋮ Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ Scheduling with product family set-up times: an application in TFT LCD manufacturing ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Greedy solutions of selection and ordering problems ⋮ Heuristics for minimizing total weighted tardiness in complex job shops ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Heuristics for minimizing total weighted tardiness in flexible flow shops ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Cites Work
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- Real-time scheduling of an automated manufacturing center
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Production scheduling of independent jobs on parallel identical processors
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Job Shop Scheduling by Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item