A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
From MaRDI portal
Publication:2312327
DOI10.1016/j.ejor.2019.06.005zbMath1430.90281OpenAlexW2951243164WikidataQ127718499 ScholiaQ127718499MaRDI QIDQ2312327
Publication date: 5 July 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.005
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)
Uses Software
Cites Work
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A systematic two phase approach for the nurse rostering problem
- The first international nurse rostering competition 2010
- Robust and online large-scale optimization. Models and techniques for transportation systems
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Staff scheduling and rostering: a review of applications, methods and models.
- Adjustable robust solutions of uncertain linear programs
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- Executing production schedules in the face of uncertainties: a review and some future directions
- The state of the art of nurse rostering
- A Theory and Algorithms for Combinatorial Reoptimization
- Guided Local Search
- Parallel Strategies for Meta-Heuristics
- Handbook of Combinatorial Optimization
- Scheduling
- Reoptimization of NP-Hard Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
