This Article Full Text (OnlineFirst PDF) Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Scopus Google Scholar Articles by Arnaout, J.-P. Social Bookmarking                         What's this?

Heuristics for the Maximization of Operating Rooms Utilization Using Simulation

Industrial Engineering Department, Lebanese American University, PO Box 36, 101-F Byblos, Lebanon

^* To whom correspondence should be addressed. E-mail: jparnaout{at}lau.edu.lb.

	Abstract

This paper addresses the problem of maximizing the utilization of operating rooms, which is translated to jobs scheduling in an identical parallel machine environment with sequence-dependent setup times and an objective of minimizing the makespan. The jobs' processing times and setup times are stochastic for better depiction of the real world. This is a non-deterministic polynomial time (NP)-hard problem, and in this paper a new heuristic is developed and compared to existing ones using simulation and optimization. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm Longest Expected Processing with Setup Time (LEPST) over the other algorithms presented.

First published on October 26, 2009
SIMULATION 2009, doi:10.1177/0037549709352497


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?