Pages that link to "Item:Q1652340"
From MaRDI portal
The following pages link to A variable neighborhood search algorithm for the surgery tactical planning problem (Q1652340):
Displaying 13 items.
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
- Solution methods for the tray optimization problem (Q1653393) (← links)
- An exact approach for tactical planning and patient selection for elective surgeries (Q1754375) (← links)
- Dynamic-programming-based heuristic for multi-objective operating theater planning (Q2076419) (← links)
- Current trends in operating room scheduling 2015 to 2020: a literature review (Q2120142) (← links)
- Solving the planning and scheduling problem simultaneously in a hospital with a bi-layer discrete particle swarm optimization (Q2160608) (← links)
- A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
- Patient mix optimization in tactical cardiothoracic surgery planning: a case study (Q5699366) (← links)
- A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks (Q6179192) (← links)
- Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms (Q6645162) (← links)
- Variable neighborhood search approach to face-shield delivery during pandemic periods (Q6659105) (← links)
