Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
From MaRDI portal
Publication:5443371
DOI10.1007/978-3-540-77918-6_4zbMath1130.90022OpenAlexW2129917688MaRDI QIDQ5443371
Tobias Brueggemann, Gerhard J. Woeginger, Tjark Vredeveld, Johann L. Hurink
Publication date: 20 February 2008
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/882130/guid-4fc740cb-08cc-4875-baff-ba6edfd449b5-ASSET1.0.pdf
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items
Cites Work
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- Quality of move-optimal schedules for minimizing total weighted completion time
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- Bounds on Multiprocessing Timing Anomalies
- Improving local search heuristics for some scheduling problems. II
