An efficient matheuristic for offline patient-to-bed assignment problems

DOI10.1016/j.ejor.2018.02.007zbMath1403.90330OpenAlexW2792551203WikidataQ62635425 ScholiaQ62635425MaRDI QIDQ1754343

Domenico Conforti, Maria Carmela Groccia, Rosita Guido

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

zbMATH Keywords

schedulingcombinatorial optimizationmatheuristicpatient bed assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

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, Structural insights about avoiding transfers in the patient-to-room assignment problem, Compatibility of short and long term objectives for dynamic patient admission scheduling, A matheuristic approach to large-scale avionic scheduling, A matheuristic algorithm for stochastic home health care planning

Uses Software

• bc-prod

Cites Work

• A study of decision support models for online patient-to-room assignment planning
• The Red-Blue transportation problem
• Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
• A survey on optimization metaheuristics
• An optimal decision-making approach for the management of radiotherapy patients
• Local search and lower bounds for the patient admission scheduling problem
• A survey of very large-scale neighborhood search techniques
• A heuristic approach for big bucket multi-level production planning problems
• Optimization models for radiotherapy patient scheduling
• Operating room planning and scheduling: a literature review
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
• Hybridizing exact methods and metaheuristics: a taxonomy
• Mixed integer programming based heuristics for the patient admission scheduling problem
• A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A column generation approach for solving the patient admission scheduling problem
• 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
• Matheuristics