| Article ID: | iaor20061704 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 29 |
| End Page Number: | 36 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Aytug Haldun, Paul Anand, Kasap Nihat |
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 Least Processing Time minimizes expected makespan.