An efficient matheuristic for offline patient-to-bed assignment problems
From MaRDI portal
Publication:1754343
Recommendations
- A stochastic model for the patient-bed assignment problem with random arrivals and departures
- A study of decision support models for online patient-to-room assignment planning
- A two level metaheuristic for the operating room scheduling and assignment problem
- Mixed integer programming based heuristics for the patient admission scheduling problem
- A column generation approach for solving the patient admission scheduling problem
Cites work
- A column generation approach for solving the patient admission scheduling problem
- A heuristic approach for big bucket multi-level production planning problems
- A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem
- A study of decision support models for online patient-to-room assignment planning
- A survey of very large-scale neighborhood search techniques
- A survey on optimization metaheuristics
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An optimal decision-making approach for the management of radiotherapy patients
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Hybridizing exact methods and metaheuristics: a taxonomy
- Local search and lower bounds for the patient admission scheduling problem
- Matheuristics
- Mixed integer programming based heuristics for the patient admission scheduling problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Operating room planning and scheduling: a literature review
- Optimization models for radiotherapy patient scheduling
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- The Red-Blue transportation problem
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(11)- A study of decision support models for online patient-to-room assignment planning
- A matheuristic approach to large-scale avionic scheduling
- A matheuristic algorithm for stochastic home health care planning
- Structural insights about avoiding transfers in the patient-to-room assignment problem
- Solving the patient admission scheduling problem using constraint aggregation
- 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
- Machine learning based integrated scheduling and rescheduling for elective and emergency patients in the operating theatre
- A stochastic model for the patient-bed assignment problem with random arrivals and departures
- Compatibility of short and long term objectives for dynamic patient admission scheduling
This page was built for publication: An efficient matheuristic for offline patient-to-bed assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754343)
