Stochastic Machine Breakdowns
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.
KeywordsProcessing Time Schedule Problem Completion Time Machine Breakdown Breakdown Process
- Ball, M., Barnhart, C., Nemhauser, G., & Odoni, A. (2007). Air transportation: Irregular operations and control. In C. Barnhart & G. Laporte (Eds.), Handbooks in operations research and management science Vol. 14 – Transportation (pp. 1–68). Amsterdam: Elsevier.Google Scholar
- Cai, X.Q.i, & Zhou, X. (1999). Stochastic scheduling on parallel machine subject to random breakdowns to minimize expected costs for earliness and tardy cost. Operations Research, 47, 422–437.Google Scholar
- Cai, X.Q.i, & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31, 317–332.Google Scholar
- Hanemann, A., Sailer, M., & Schmitz, D. (2005). Towards a framework for IT service fault management. In Proceedings of the European University information systems conference (EUNIS 2005), Manchester.Google Scholar
- Iannaccone, G., Chuah, C., Mortier, R., Bhattacharyya, S., & Diot, C. (2002). Analysis of link failures in an IP backbone. In Proceedings of ACM SIGCOMM internet measurement workshop, Marseille.Google Scholar