Maximizing the utilization of operating rooms with stochastic times using simulation

This paper addresses a surgery rooms scheduling problem. The problem is modeled as a parallel machine scheduling problem with sequence dependent setup times and an objective of minimizing the makespan. This is a NP-hard problem and in this paper, a solution heuristic is developed and compared to existing ones using simulation. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm LEPST over the other algorithms presented.

[1]  F. Dexter,et al.  An operating room scheduling strategy to maximize the use of operating room block time: computer simulation of patient scheduling and survey of patients' preferences for surgical waiting time. , 1999, Anesthesia and analgesia.

[2]  Randall P. Sadowski,et al.  Simulation with Arena , 1998 .

[3]  Ravi Sethi,et al.  On the Complexity of Mean Flow Time Scheduling , 1977, Math. Oper. Res..

[4]  F. Dexter.  A Strategy to Decide Whether to Move the Last Case of the Day in an Operating Room to Another Empty Operating Room to Decrease Overtime Labor Costs , 2000, Anesthesia and analgesia.

[5]  Pierre Ladet,et al.  OPERATING ROOMS SCHEDULING , 2006 .

[6]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[7]  Wu Cheng,et al.  A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines , 1999, Artif. Intell. Eng..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[10]  Rolf H. Möhring,et al.  Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.

[11]  Ta R A Ja.  EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES , 2001 .

[12]  J. Walrand,et al.  Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime , 1986, Journal of Applied Probability.

[13]  John Lu,et al.  Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective , 2001 .

[14]  N. K. Kwak,et al.  Monte Carlo Simulation of Operating-Room and Recovery-Room Usage , 1972, Oper. Res..

[15]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[16]  K. Glazebrook.  Scheduling tasks with exponential service times on parallel processors , 1979 .

[17]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[18]  Alain Guinet,et al.  Operating theatre planning. , 2003, Nursing mirror and midwives journal.

[19]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[20]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[21]  Ghaith Rabadi,et al.  A Dynamic Heuristic for the Stochastic Unrelated Parallel Machine Scheduling Problem , 2006 .

[22]  F. Dexter,et al.  An operating room scheduling strategy to maximize the use of operating room block time: Computer simulation of patient scheduling and survey of patients' preferences for surgical waiting time , 1999 .

[23]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .