Stochastic Machine Breakdowns

Xiaoqiang Cai, Xianyi Wu and Xian Zhou
Additional contact information
Xiaoqiang Cai: The Chinese University of Hong Kong
Xianyi Wu: East China Normal University
Xian Zhou: Macquarie University

Chapter Chapter 4 in Optimal Stochastic Scheduling, 2014, pp 141-185 from Springer

Abstract: Abstract The majority of machine scheduling problems studied in the literature assume that the machine used to process the jobs is continuously available until all jobs are completed. In reality, however, it is a common phenomenon that a machine may break down randomly from time to time. This chapter covers scheduling problems where the machines are subject to stochastic breakdowns. We first formulate machine breakdown processes in Section 4.1, then discuss the optimal policies under the no-loss, total-loss and partial-loss machine breakdown models in Section 4.2–4.4, respectively. This chapter focuses on optimal static policies. Optimal dynamic policies will be introduced in Chapter 7.

Keywords: Processing Time; Schedule Problem; Completion Time; Machine Breakdown; Breakdown Process (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-1-4899-7405-1_4

Ordering information: This item can be ordered from
http://www.springer.com/9781489974051

DOI: 10.1007/978-1-4899-7405-1_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().