Article ID Journal Published Year Pages File Type
1143453 Operations Research Letters 2006 8 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Minimizing makespan on a single machine subject to random breakdowns
Authors
, , ,