Mixed integer programming based heuristics for the patient admission scheduling problem
From MaRDI portal
Publication:1652186
DOI10.1016/j.cor.2016.11.016zbMath1391.90668OpenAlexW2552391616MaRDI QIDQ1652186
Bilge Bilgen, Aykut Melih Turhan
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.016
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (7)
A mixed integer programming approach to the patient admission scheduling problem ⋮ Admission control of hospitalization with patient gender by using Markov decision process ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Operating room planning and surgical case scheduling: a review of literature ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Compatibility of short and long term objectives for dynamic patient admission scheduling ⋮ An efficient matheuristic for offline patient-to-bed assignment problems
Cites Work
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- Surgical scheduling with simultaneous employment of specialised human resources
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- A fix-and-optimize heuristic for the high school timetabling problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics
- Mathematical programming-based approaches for multi-facility Glass container production planning
- Using and extending fix-and-relax to solve maritime inventory routing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Local search and lower bounds for the patient admission scheduling problem
- On solving the multi-period single-sourcing problem under uncertainty
- A heuristic approach for big bucket multi-level production planning problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- On practical resource allocation for production planning and scheduling with period overlapping setups
- A lot-sizing and scheduling model for multi-stage flow lines with zero lead times
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- A column generation approach for solving the patient admission scheduling problem
- Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
- Pricing, relaxing and fixing under lot sizing and scheduling
- Furniture supply chain tactical planning optimization using a time decomposition approach
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Production Planning by Mixed Integer Programming
This page was built for publication: Mixed integer programming based heuristics for the patient admission scheduling problem