Maximizing the utilization of operating rooms with stochastic times using simulation

Authors:
Jean-Paul M. Arnaout;Sevag Kulbashian
Affiliations:
Lebanese American University, Byblos, Lebanon;Lebanese American University, Byblos, Lebanon
Venue:
Proceedings of the 40th Conference on Winter Simulation
Year:
2008

Citing 6
Cited 1

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Journal of the ACM (JACM)
Approximation in stochastic scheduling: the power of LP-based priority policies

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Simulation with Arena

Simulation with Arena
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES

Probability in the Engineering and Informational Sciences
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Heuristics for the Maximization of Operating Rooms Utilization Using Simulation

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.