A heuristic for preemptive scheduling with set-up times
DOI10.1007/BF02238747zbMATH Open0773.90039MaRDI QIDQ1202243FDOQ1202243
Gerhard J. Woeginger, Zhongliang Yu
Publication date: 25 February 1993
Published in: Computing (Search for Journal in Brave)
Recommendations
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Lot-sizing scheduling with batch setup times
- Non-preemptive scheduling with setup times: a PTAS
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- A heuristic algorithm for minimizing mean flow time with unit setups
heuristicsNP-completeidentical parallel machinespreemptive schedulingpolynomial time approximation algorithm\(m\) parallel machinesconstant (job- and machine-independent) set-up timesworst- case analysis
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling with deadlines and loss functions
- On the Complexity of Scheduling with Batch Setup Times
- Time bounds for selection
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Performance Guarantees for Scheduling Algorithms
Cited In (12)
- Improved heuristics for the early/tardy scheduling problem with no idle time
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Title not available (Why is that?)
- Heuristics to Schedule Service Engineers within Time Windows
- Survey of scheduling research involving setup times
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- Approximation algorithms for problems in scheduling with set-ups
- Strategic Scheduling Games: Equilibria and Efficiency
- A heuristic algorithm for minimizing mean flow time with unit setups
- Scheduling in switching networks with set-up delays
- Non-preemptive scheduling with setup times: a PTAS
This page was built for publication: A heuristic for preemptive scheduling with set-up times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202243)
