Compatibility of short and long term objectives for dynamic patient admission scheduling
From MaRDI portal
Publication:1725603
DOI10.1016/j.cor.2018.12.001zbMath1458.90384OpenAlexW2902502264WikidataQ128828890 ScholiaQ128828890MaRDI QIDQ1725603
Yi-Hang Zhu, Wim Vancroonenburg, Túlio A. M. Toffolo, Greet vanden Berghe
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.001
Related Items (2)
Admission control of hospitalization with patient gender by using Markov decision process ⋮ Structural insights about avoiding transfers in the patient-to-room assignment problem
Cites Work
- A study of decision support models for online patient-to-room assignment planning
- The Red-Blue transportation problem
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- Scheduling operating rooms: achievements, challenges and pitfalls
- Local search and lower bounds for the patient admission scheduling problem
- Mixed integer programming based heuristics for the patient admission scheduling problem
- An efficient matheuristic for offline patient-to-bed assignment problems
- A column generation approach for solving the patient admission scheduling problem
- The dynamic multi-period vehicle routing problem
- Decomposition Principle for Linear Programs
- Selected Topics in Column Generation
This page was built for publication: Compatibility of short and long term objectives for dynamic patient admission scheduling