List scheduling in a parallel machine environment with precedence constraints and setup times

DOI10.1016/S0167-6377(01)00104-3zbMath0993.90035MaRDI QIDQ1604056

Sigrid Knust, Johann L. Hurink

Publication date: 3 July 2002

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

zbMATH Keywords

complexity; scheduling; parallel machines; list scheduling; setup times

Mathematics Subject Classification ID

90B25: Reliability, availability, maintenance, inspection in operations research

65Y20: Complexity and performance of numerical algorithms

Related Items

A flow-based tabu search algorithm for the RCPSP with transfer times, Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis, Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Parallel machine scheduling with precedence constraints and setup times, A survey of scheduling problems with setup times or costs, Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions

Cites Work

• Unnamed Item
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• List scheduling revisited
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Complexity of Scheduling with Batch Setup Times
• An Exact Method for Solving the Multi-Processor Flow-Shop
• Bounds on Multiprocessing Timing Anomalies