Minimizing makespan on a single machine subject to random breakdowns

Kasap, Nihat and Aytuğ, Haldun and Paul, Anand (2006) Minimizing makespan on a single machine subject to random breakdowns. Operations Research Letters, 34 (1). pp. 29-36. ISSN 0167-6377

PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
162Kb

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.

Item Type:	Article
Uncontrolled Keywords:	Sequencing; Stochastic scheduling; Expected makespan; Unreliable machine
Subjects:	T Technology > T Technology (General)
ID Code:	695
Deposited By:	Nihat Kasap
Deposited On:	30 Dec 2005 02:00
Last Modified:	25 May 2011 14:09

Repository Staff Only: item control page