Local search and lower bounds for the patient admission scheduling problem
From MaRDI portal
Publication:632698
Recommendations
- A column generation approach for solving 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 mixed integer programming approach to the patient admission scheduling problem
- A variable neighborhood search algorithm for the surgery tactical planning problem
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 2144491 (Why is no real title available?)
- A general approach to the physician rostering problem
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
- Developing a platform for comparison of hospital admission systems: an illustration
- Hospital Waiting List Management Models
- Neighborhood portfolio approach for local search applied to timetabling problems
- Operations research and health care. A handbook of methods and applications.
- 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
- Optimization by simulated annealing
- Robust surgery loading
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Statistical Analysis of Financial Data in S-Plus
- Stochastic local search. Foundations and applications.
- The state of the art of nurse rostering
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(18)- An efficient matheuristic for offline patient-to-bed assignment problems
- A study of decision support models for online patient-to-room assignment planning
- Solving the patient admission scheduling problem using constraint aggregation
- Mixed integer programming based heuristics for the patient admission scheduling problem
- The Red-Blue transportation problem
- Scheduling the hospital-wide flow of elective patients
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- 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
- A mixed integer programming approach to the patient admission scheduling problem
- Structural insights about avoiding transfers in the patient-to-room assignment problem
- Compatibility of short and long term objectives for dynamic patient admission scheduling
- Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms
- On the performance of scatter search for post-enrolment course timetabling problems
- A column generation approach for solving the patient admission scheduling problem
- One transfer per patient suffices: structural insights about patient-to-room assignment
- Operating room planning and surgical case scheduling: a review of literature
This page was built for publication: Local search and lower bounds for the patient admission scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632698)
