A comparison of two approaches to nurse rostering problems
From MaRDI portal
Publication:1761915
DOI10.1007/s10479-010-0808-9zbMath1251.90176OpenAlexW1979788481MaRDI QIDQ1761915
Sanja Petrovic, 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/280439
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ A heuristic algorithm based on multi-assignment procedures for nurse scheduling ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ ``You have to get wet to learn how to swim applied to bridging the gap between research into personnel scheduling and its implementation in practice ⋮ An integer programming approach for the physician rostering problem ⋮ A decision support model for staff allocation of mobile medical service ⋮ Local search neighbourhoods for dealing with a novel nurse rostering model ⋮ Towards a reference model for timetabling and rostering ⋮ Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implicit tour scheduling model with applications in healthcare
- Building better nurse scheduling algorithms
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- A hybrid metaheuristic case-based reasoning system for nurse rostering
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A 0-1 goal programming model for nurse scheduling
- Preference scheduling for nurses using column generation
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
- The state of the art of nurse rostering
- Distributed personnel scheduling -- negotiation among scheduling agents
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- Handling fuzzy temporal constraints in a planning environment
- A memetic approach to the nurse rostering problem
This page was built for publication: A comparison of two approaches to nurse rostering problems
