Exponential size neighborhoods for makespan minimization scheduling
From MaRDI portal
Publication:2892138
DOI10.1002/nav.20485zbMath1241.90043OpenAlexW2159781473MaRDI QIDQ2892138
Tjark Vredeveld, Tobias Brueggemann, Gerhard J. Woeginger, Johann L. Hurink
Publication date: 18 June 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20485
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Theoretical aspects of local search.
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- 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
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Survey of Approximation Results for Local Search Algorithms
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Improving local search heuristics for some scheduling problems. II
This page was built for publication: Exponential size neighborhoods for makespan minimization scheduling