List scheduling in a parallel machine environment with precedence constraints and setup times
From MaRDI portal
Publication:1604056
DOI10.1016/S0167-6377(01)00104-3zbMath0993.90035OpenAlexW2161640904MaRDI QIDQ1604056
Sigrid Knust, Johann L. Hurink
Publication date: 3 July 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00104-3
Reliability, availability, maintenance, inspection in operations research (90B25) Complexity and performance of numerical algorithms (65Y20)
Related Items
Two-stage hybrid flowshop scheduling with simultaneous processing machines, A flow-based tabu search algorithm for the RCPSP with transfer times, Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions, Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, An exact branch-and-price approach for the medical student scheduling problem, Bounds for parallel machine scheduling with predefined parts of jobs and setup time, Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints, A survey of scheduling problems with setup times or costs, Parallel machine scheduling with precedence constraints and setup times, Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds, Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
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
