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
![[thumbnail of 3011800001019.pdf]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF
3011800001019.pdf
Restricted to Repository staff only
Download (166kB) | Request a copy
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) |
| Divisions: | Sabancı Business School |
| Depositing User: | Nihat Kasap |
| Date Deposited: | 30 Dec 2005 02:00 |
| Last Modified: | 26 Apr 2022 08:12 |
| URI: | https://research.sabanciuniv.edu/id/eprint/695 |
Actions (login required)
- View Item