Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns

Jinwei Gu, Manzhan Gu and Xingsheng Gu

Mathematical Problems in Engineering, 2014, vol. 2014, 1-9

Abstract:

This paper studies the problem of scheduling a set of jobs on a single machine subject to stochastic breakdowns, where jobs have to be restarted if preemptions occur because of breakdowns. The breakdown process of the machine is independent of the jobs processed on the machine. The processing times required to complete the jobs are constants if no breakdown occurs. The machine uptimes are independently and identically distributed (i.i.d.) and are subject to a uniform distribution. It is proved that the Longest Processing Time first (LPT) rule minimizes the expected makespan. For the large-scale problem, it is also showed that the Shortest Processing Time first (SPT) rule is optimal to minimize the expected total completion times of all jobs.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/260415.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/260415.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:260415

DOI: 10.1155/2014/260415

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().