Minimizing makespan on a single machine subject to random breakdowns

Authors:
Nihat Kasap;Haldun Aytug;Anand Paul
Affiliations:
Graduate School of Management, Sabanci University, Istanbul, Turkey;Decision and Information Sciences, The Warrington College of Business Administration, University of Florida, Gainesville, FL 32611, USA;Decision and Information Sciences, The Warrington College of Business Administration, University of Florida, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
2006

Citing 3
Cited 3

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities

Operations Research Letters

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks
Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Operations Research
Erratum: Erratum to "Minimizing makespan on a single machine subject to random breakdowns"

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.