An efficient matheuristic for offline patient-to-bed assignment problems
DOI10.1016/J.EJOR.2018.02.007zbMATH Open1403.90330DBLPjournals/eor/GuidoGC18OpenAlexW2792551203WikidataQ62635425 ScholiaQ62635425MaRDI QIDQ1754343FDOQ1754343
Authors: Rosita Guido, Maria Carmela Groccia, Domenico Conforti 
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.02.007
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Matheuristics
- Operating room planning and scheduling: a literature review
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A study of decision support models for online patient-to-room assignment planning
- Local search and lower bounds for the patient admission scheduling problem
- A survey of very large-scale neighborhood search techniques
- The Red-Blue transportation problem
- A column generation approach for solving the patient admission scheduling problem
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- A survey on optimization metaheuristics
- Hybridizing exact methods and metaheuristics: a taxonomy
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- A heuristic approach for big bucket multi-level production planning problems
- Optimization models for radiotherapy patient scheduling
- An optimal decision-making approach for the management of radiotherapy patients
- A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem
- Mixed integer programming based heuristics for the patient admission scheduling problem
Cited In (10)
- A matheuristic approach to large-scale avionic scheduling
- Solving the patient admission scheduling problem using constraint aggregation
- 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
- A matheuristic algorithm for stochastic home health care planning
- 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
- Structural insights about avoiding transfers in the patient-to-room assignment problem
- Compatibility of short and long term objectives for dynamic patient admission scheduling
- One transfer per patient suffices: structural insights about patient-to-room assignment
Uses Software
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)
