Minimizing makespan on a single machine subject to random breakdowns |
| |
| Authors: | Nihat Kasap Anand Paul |
| |
| Affiliation: | a Graduate School of Management, Sabanci University, Istanbul, Turkey
b Decision and Information Sciences, The Warrington College of Business Administration, University of Florida, Gainesville, FL 32611, USA |
| |
| Abstract: | We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan. |
| |
| Keywords: | Sequencing Stochastic scheduling Expected makespan Unreliable machine |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
