Turnpike optimality of Smith's Rule in parallel machines stochastic scheduling
Mathematics of Operations Research
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
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES
Probability in the Engineering and Informational Sciences
Maximizing the utilization of operating rooms with stochastic times using simulation
Proceedings of the 40th Conference on Winter Simulation
ACO for the Surgical Cases Assignment Problem
Journal of Medical Systems
| Hi-index | 0.00 |
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.