Heuristics and Simulated Annealing Algorithm for the Surgical Scheduling Problem
Küçük Resim Yok
Tarih
2016
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Planning and scheduling play a very important role in health care. Effective scheduling optimizes the utilization of scarce resources such as operating rooms (ORs), devices in hospitals, and surgeons. Therefore, operations research/operations management techniques have been frequently used in health care systems management. In this chapter, we examine the surgical scheduling problem over multiple operating rooms. In order to find an optimal solution to surgical scheduling problem, mixed-integer programming (MIP) formulation of the surgical scheduling problem is presented. The model includes constraints for several operational rules and requirements found in most hospitals, and specifically minimizes the total weighted start time as a performance measure (or objective function). Since the problem is known to be an NP-hard in most of its forms, heuristic algorithms (i.e., greedy heuristics and a metaheuristic) are also introduced to find near-optimal solutions efficiently.
Açıklama
Anahtar Kelimeler
Health Care Services, Surgical Scheduling, Simulated Annealing, Greedy Heuristic, Metaheuristic, Mathematical Programming, Monte-Carlo-Simulation, Operating-Room Time, Programming Approach, Allocation, Hospitals, Constraints, Strategy, Theater, Costs, Usage
Kaynak
Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
236
