Towards a reference model for timetabling and rostering
From MaRDI portal
Publication:1761899
DOI10.1007/s10479-010-0721-2zbMath1251.90129OpenAlexW1995801303MaRDI QIDQ1761899
Patrick de Causmaecker, Greet vanden Berghe
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/262343
Related Items (5)
A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern ⋮ A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand ⋮ Bridging the gap between self schedules and feasible schedules in staff scheduling ⋮ Network flow models for intraday personnel scheduling problems ⋮ Personnel scheduling: models and complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomially solvable personnel rostering problems
- A survey of search methodologies and automated system development for examination timetabling
- On the characterization and generation of nurse scheduling problem instances
- The nurse rostering problem: a critical appraisal of the problem structure
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- A comparison of two approaches to nurse rostering problems
- Variants of simulated annealing for the examination timetabling problem
- A decomposed metaheuristic approach for a real-world university timetabling problem
- The state of the art of nurse rostering
- Hierarchical Hardness Models for SAT
- On Manpower Scheduling Algorithms
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A memetic approach to the nurse rostering problem
This page was built for publication: Towards a reference model for timetabling and rostering
