A hybrid integer and constraint programming approach to solve nurse rostering problems
From MaRDI portal
Publication:1652269
DOI10.1016/j.cor.2017.01.016zbMath1391.90362DBLPjournals/cor/RahimianAL17OpenAlexW2582489078WikidataQ56476049 ScholiaQ56476049MaRDI QIDQ1652269
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/59727/
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items (7)
Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ A goal programming approach to nurse scheduling with individual preference satisfaction ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ Fatigue, personnel scheduling and operations: review and research opportunities
Uses Software
Cites Work
- Unnamed Item
- Integer programming techniques for the nurse rostering problem
- 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
- Personnel scheduling: models and complexity
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- The nurse rostering problem: a critical appraisal of the problem structure
- Staff scheduling and rostering: a review of applications, methods and models.
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A Pareto-based search methodology for multi-objective nurse scheduling
- On the complexity of manpower shift scheduling
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- The state of the art of nurse rostering
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- New approaches to nurse rostering benchmark instances
- Generating effective symmetry-breaking predicates for search problems
- A memetic approach to the nurse rostering problem
This page was built for publication: A hybrid integer and constraint programming approach to solve nurse rostering problems
