MAXIMIZING THE UTILIZATION OF OPERATING ROOMS WITH STOCHASTIC TIMES USING SIMULATION

被引:17
作者
Arnaout, Jean-Paul M. [1 ]
Kulbashian, Sevag [1 ]
机构
[1] Lebanese Amer Univ, Dept Ind Engn, Byblos, Lebanon
来源
2008 WINTER SIMULATION CONFERENCE, VOLS 1-5 | 2008年
关键词
EXPONENTIAL SERVICE TIMES; PARALLEL MACHINES; SCHEDULING TASKS; SETUP TIMES; MAKESPAN; MINIMIZE; PROCESSORS; STRATEGY; JOBS;
D O I
10.1109/WSC.2008.4736245
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:1617 / 1623
页数:7
相关论文
共 23 条