List scheduling revisited

DOI10.1016/0167-6377(95)00057-7MaRDI QIDQ1919183zbMATH OpenOpenAlexFDO

Authors 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 machineslist schedulesregular cost functionssequence dependent setup times

Mathematics Subject Classification ID

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

Recommendations

• On the Expected Relative Performance of List Scheduling
• List scheduling with and without communication delays
• Probabilistic Bounds on the Performance of List Scheduling
• Decentralized list scheduling
• List scheduling of parallel tasks
• An efficient list scheduling algorithm for time placement problem
• List scheduling for jobs with arbitrary release times and unit-processing time
• List scheduling with duplication for heterogeneous computing systems
• List scheduling in the presence of branches. A theoretical evaluation
• List scheduling in a parallel machine environment with precedence constraints and setup times

Cites work

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

Cited in

(13)

• List scheduling in a parallel machine environment with precedence constraints and setup times
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• Multi-machine scheduling lower bounds using decision diagrams
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• A machine assignment mechanism for compile-time list-scheduling heuristics
• Padded Lists Revisited
• Job scheduling
• List Scheduling in Order of α-Points on a Single Machine
• List scheduling of parallel tasks
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
• Parallel machine scheduling with precedence constraints and setup times

This page was built for publication: List scheduling revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919183)