Structural insights about avoiding transfers in the patient-to-room assignment problem

DOI10.1016/J.DAM.2023.12.025MaRDI QIDQ6202948zbMATH OpenFDO

Authors Tabea Brandt, Christina Büsing, Sigrid Knust

Publication date 27 February 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2023.12.025

zbMATH Keywords

combinatorial optimizationcomplexitypatient-to-room assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• One transfer per patient suffices: structural insights about patient-to-room assignment
• A study of decision support models for online patient-to-room assignment planning
• scientific article; zbMATH DE number 1594585
• An efficient matheuristic for offline patient-to-bed assignment problems
• A stochastic model for the patient-bed assignment problem with random arrivals and departures

Cites work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A column generation approach for solving the patient admission scheduling problem
• A mixed integer programming approach to the patient admission scheduling problem
• An efficient matheuristic for offline patient-to-bed assignment problems
• Compatibility of short and long term objectives for dynamic patient admission scheduling
• Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
• Local search and lower bounds for the patient admission scheduling problem
• One transfer per patient suffices: structural insights about patient-to-room assignment
• The Red-Blue transportation problem
• The transportation problem with conflicts

Cited in

(2)

• Patient-to-room assignment with single-rooms entitlements: combinatorial insights and integer programming formulations
• One transfer per patient suffices: structural insights about patient-to-room assignment

This page was built for publication: Structural insights about avoiding transfers in the patient-to-room assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202948)