Minimizing makespan on a single machine subject to random breakdowns
||The system is temporarily closed to updates for reporting purpose.
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
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.
|Uncontrolled Keywords:||Sequencing; Stochastic scheduling; Expected makespan; Unreliable machine|
|Subjects:||T Technology > T Technology (General)|
|Deposited By:||Nihat Kasap|
|Deposited On:||30 Dec 2005 02:00|
|Last Modified:||25 May 2011 14:09|
Repository Staff Only: item control page