List scheduling revisited

DOI10.1016/0167-6377(95)00057-7zbMath0855.90071OpenAlexW2138403270MaRDI QIDQ1919183

J. M. J. Schutten

Publication date: 11 February 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/list-scheduling-revisited(cacf930c-ccef-4b0b-95df-6a5782500c0e).html

zbMATH Keywords

identical parallel machinessequence dependent setup timeslist schedulesregular cost functions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ Parallel machine scheduling with precedence constraints and setup times ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ List scheduling in a parallel machine environment with precedence constraints and setup times ⋮ Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Cites Work

• Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
• Bounds for List Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Bounds on Multiprocessing Timing Anomalies