Nurse rostering at a Danish ward

DOI10.1007/s10479-013-1511-4zbMath1303.90098OpenAlexW2073825427MaRDI QIDQ490204

Jonas Baeklund

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1511-4

zbMATH Keywords

constraint programmingpersonnel schedulingconstraint programming based column generationnurse-rosteringnurse-scheduling

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• A grasp-knapsack hybrid for a nurse-scheduling problem
• A generalized linear programming model for nurse scheduling
• Nurse rostering problems -- a bibliographic survey.
• A greedy-based neighborhood search approach to a nurse rostering problem.
• Branching rules revisited
• The state of the art of nurse rostering
• Solving a nurse scheduling problem with knapsacks, networks and tabu search
• Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
• Constraint Programming Based Column Generation for Employee Timetabling
• A memetic approach to the nurse rostering problem

This page was built for publication: Nurse rostering at a Danish ward