Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns
Joint Authors
Gu, Jinwei
Gu, Manzhan
Gu, Xingsheng
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-09-28
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Gu, Jinwei& Gu, Manzhan& Gu, Xingsheng. 2014. Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1044130
Modern Language Association (MLA)
Gu, Jinwei…[et al.]. Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns. Mathematical Problems in Engineering No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-1044130
American Medical Association (AMA)
Gu, Jinwei& Gu, Manzhan& Gu, Xingsheng. Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1044130
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1044130