Heuristics for unrelated machine scheduling with precedence constraints
From MaRDI portal
Publication:1290706
DOI10.1016/S0377-2217(96)00247-0zbMath0951.90555MaRDI QIDQ1290706
Nathalie Sauer, Jeffrey W. Herrmann, Jean Marie Proth
Publication date: 17 December 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ A new heuristic and an exact approach for a production planning problem ⋮ Scheduling three chains on two parallel machines
Cites Work
- Optimization by Simulated Annealing
- Approximation algorithms for scheduling unrelated parallel machines
- A state-of-the-art review of parallel-machine scheduling research
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- NP-complete scheduling problems
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Heuristics for scheduling unrelated parallel machines
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Algorithms for Scheduling Tasks on Unrelated Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Heuristics for unrelated machine scheduling with precedence constraints