Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
From MaRDI portal
Publication:4399116
DOI10.1080/00207549508904867zbMath0911.90217OpenAlexW2015593788MaRDI QIDQ4399116
Publication date: 20 April 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549508904867
job shopmaximum latenesssetup timesparallel identical machinesdynamic job arrivalsrolling horizon heuristics
Related Items
Infinite capacity planning for IC packaging plants ⋮ An adaptive scheduling algorithm for a parallel machine problem with rework processes ⋮ Preemption in single machine earliness/tardiness scheduling ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ Aversion scheduling in the presence of risky jobs ⋮ Adaptive scheduling and tool flow control in flexible job shops ⋮ Coordinating decentralized local schedulers in complex supply chain manufacturing ⋮ Terminal inventory level constraints for online production scheduling ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs ⋮ In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations ⋮ A review of planning and scheduling systems and methods for integrated steel production ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ Parallel machine scheduling with precedence constraints and setup times ⋮ Scheduling of unrelated parallel manufacturing cells with limited human resources ⋮ A Progressive Hedging Approach for Surgery Planning Under Uncertainty ⋮ Capacity-constrained scheduling for a logic IC final test facility ⋮ Scheduling of wafer test processes in semiconductor manufacturing ⋮ Benchmarks for shop scheduling problems ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Cites Work
- Scheduling batches on parallel machines with major and minor set-ups
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- Bounds for naive multiple machine scheduling with release times and deadlines
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Bounds on Multiprocessing Timing Anomalies
- Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
