Heuristics and Simulated Annealing Algorithm for the Surgical Scheduling Problem


Hancerliogullari G. , Koksalmis E., Hancerliogullari K. O.

HEURISTICS, METAHEURISTICS AND APPROXIMATE METHODS IN PLANNING AND SCHEDULING, cilt.236, ss.225-241, 2016 (Diğer Kurumların Hakemli Dergileri) identifier

  • Cilt numarası: 236
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1007/978-3-319-26024-2_12
  • Dergi Adı: HEURISTICS, METAHEURISTICS AND APPROXIMATE METHODS IN PLANNING AND SCHEDULING
  • Sayfa Sayıları: ss.225-241

Ö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.