A study of decision support models for online patient-to-room assignment planning

DOI10.1007/s10479-013-1478-1zbMath1336.90055OpenAlexW2118098980MaRDI QIDQ284425

Wim Vancroonenburg, Patrick de Causmaecker, Greet vanden Berghe

Publication date: 18 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10479-013-1478-1

zbMATH Keywords

mixed integer linear programmingdynamic planningpatient assignment problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery, Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach, Operating room scheduling for non-operating room anesthesia with emergency uncertainty, Compatibility of short and long term objectives for dynamic patient admission scheduling, An efficient matheuristic for offline patient-to-bed assignment problems

Uses Software

• R
• CPLEX

Cites Work

• Algorithms for large scale shift minimisation personnel task scheduling problems
• Local search and lower bounds for the patient admission scheduling problem
• Building cyclic master surgery schedules with leveled resulting bed occupancy
• Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
• Operating room planning and scheduling: a literature review
• The state of the art of nurse rostering
• Interval scheduling: A survey