Local search and lower bounds for the patient admission scheduling problem
From MaRDI portal
Publication:632698
DOI10.1016/j.cor.2011.01.007zbMath1208.90110OpenAlexW1980986584MaRDI QIDQ632698
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.007
Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (16)
A study of decision support models for online patient-to-room assignment planning ⋮ The Red-Blue transportation problem ⋮ Scheduling the hospital-wide flow of elective patients ⋮ A mixed integer programming approach to the patient admission scheduling problem ⋮ Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ A stochastic model for the patient-bed assignment problem with random arrivals and departures ⋮ Admission control of hospitalization with patient gender by using Markov decision process ⋮ Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ One transfer per patient suffices: structural insights about patient-to-room assignment ⋮ Operating room planning and surgical case scheduling: a review of literature ⋮ Structural insights about avoiding transfers in the patient-to-room assignment problem ⋮ Compatibility of short and long term objectives for dynamic patient admission scheduling ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ A column generation approach for solving the patient admission scheduling problem ⋮ On the performance of scatter search for post-enrolment course timetabling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Developing a platform for comparison of hospital admission systems: an illustration
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
- A general approach to the physician rostering problem
- Operations research and health care. A handbook of methods and applications.
- Robust surgery loading
- The state of the art of nurse rostering
- Neighborhood portfolio approach for local search applied to timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Statistical Analysis of Financial Data in S-Plus
- Hospital Waiting List Management Models
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
This page was built for publication: Local search and lower bounds for the patient admission scheduling problem
