A two-phase adaptive variable neighborhood approach for nurse rostering

DOI10.1016/j.cor.2015.02.009zbMath1348.90371OpenAlexW2018880500MaRDI QIDQ337577

Ioannis P. Solos, Ioannis X. Tassopoulos, Grigorios N. Beligiannis

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.009

zbMATH Keywords

nurse rosteringhospital personnel schedulingtwo-phase algorithmvariable neighborhood

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Related Items (7)

A hybrid integer and constraint programming approach to solve nurse rostering problems ⋮ Genetic based discrete particle swarm optimization for elderly day care center timetabling ⋮ On a timetabling problem in the health care system ⋮ The nurse rerostering problem: strategies for reconstructing disrupted schedules ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization

Cites Work

• A systematic two phase approach for the nurse rostering problem
• The first international nurse rostering competition 2010
• An evolutionary approach for the nurse rerostering problem
• A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
• Personnel scheduling: a literature review
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A two-phase adaptive variable neighborhood approach for nurse rostering