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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adiri, I., Bruno, J., Frostig, E., & Rinnooy Kan, A. H. G. (1989). Single machine flowtime scheduling with a single breakdown. Acta Informatica, 26, 679–696.
Adiri, I., Frostig, E., & Rinnooy Kan, A. H. G. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics, 38, 261–271.
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.
Birge, J., Frenk, J. B. G., Mittenthal, J., & Rinnooy Kan, A. H. G. (1990). Single-machine scheduling subject to stochastic breakdown. Naval Research Logistics, 37, 661–677.
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.
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.
Cai, X.Q., Sun, X., & Zhou, X. (2003). Stochastic scheduling with breakdown-repeat machine breakdowns to minimize the expected weighted flowtime. Probability in the Engineering and Informational Sciences, 17, 467–485.
Cai, X.Q., Sun, X., & Zhou, X. (2004). Stochastic scheduling subject to machine breakdowns: The breakdown-repeat model with discounted reward and other criteria. Naval Research Logistics, 51, 800–817.
Cai, X.Q., Wu, X.Y., & Zhou, X. (2009a). Stochastic scheduling on parallel machines to minimize discounted holding costs. Journal of Scheduling, 12(4), 375–388.
Cai, X. Q., Lee, C.-Y., & Wong, T. L. (2000). Multi-processor task scheduling to minimize the maximum tardiness and the total completion time. IEEE Transactions on Robotics and Automation, 16, 824–830.
Chimento, P. F., & Trivedi, K. S. (1993). The completion time of programs on processors subject to failure and repair. IEEE Transactions on Computers, 42, 1184–1194.
Duffy, J. A. (2000). Service recovery. In J. A. Fitzsimmons (Ed.), New service development: Creating memorable experiences (pp. 277–290). Thousand Oaks: SAGE.
Frostig, E. (1991). A note on stochastic scheduling on a single machine subject to breakdown – The preemptive repeat model. Probability in the Engineering and Informational Sciences, 5, 349–354.
Glazebrook, K. D., & Owen, R. W. (1991). New results for generalised bandit processes. International Journal of Systems Science, 22, 479–494.
Glazebrook, K. D. (2005). Optimal scheduling of tasks when service is subject to disruption: The preempt-repeat case. Mathematical Methods of Operations Research, 61, 147–169.
Groenevelt, H., Pintelon, L., & Seidmann, A. (1992). Prodution batching with machine breakdowns and safty stocks. Operations Research, 40, 959–971.
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.
Heathcote, C. R. (1961). Preemptive priority queueing. Biometrika, 48, 57–63.
Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165, 289–306.
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.
Jain, S., & Foley, W. J. (2002). Impact of interruptions on schedule execution in flexible manufacturing systems. International Journal of Flexible Manufacturing Systems, 14, 319–344.
Lee, C. Y., & Lin, C. S. (2001). Single-machine scheduling with maintenance and repair rate-modifying activities. European Journal of Operational Research, 135, 493–513.
Lee, C. Y., & Yu, G. (2007). Single machine scheduling under potential disruption. Operations Research Letters, 35, 541–548.
Li, W., Braun, W. J., & Zhao, Y. Q. (1998). Stochastic scheduling on a repairable machine with Erlang uptime distribution. Advances in Applied Probability, 30(4), 1073–1088.
Mehta, S. V., & Uzsoy, R. M. (1998). Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation, 14, 365–378.
Mittenthal, J., & Raghavachari, M. (1993). Stochastic single machine scheduling with quadratic early-tardy penalties. Operations Research, 41, 786–796.
Nicola, V. F., Kulkarni, V. G., & Trivedi, K. S. (1987). A queueing analysis of fault-tolerant computer systems. IEEE Transactions on Software Engineering, 13, 363–375.
Pinedo, M., & Rammouz, E. (1988). A note on stochastic scheduling on a single machine subject to breakdown and repair. Probability in the Engineering and Informational Sciences, 2, 41–49.
Qi, X. D., Yin, G., & Birge, J. R. (2000a). Scheduling problems with random processing times under expected earliness/tardiness costs. Stochastic Analysis and Applications, 18, 453–473.
Qi, X. D., Yin, G., & Birge, J. R. (2000b). Single machine scheduling with random machine breakdowns and randomly compressible processing times. Stochastic Analysis and Applications, 18, 635–653.
Rothkopf, M. H. (1966a). Scheduling with random service times. Management Science, 12, 707–713.
Rothkopf, M. H., & Smith, S. A. (1984). There are no undiscovered priority index sequencing rules for minimizing total delay costs. Operations Research, 32, 451–456.
Takine, T., & Sengupta, B. (1997). A single server queue with service interruptions. Journal of Queueing Systems, 26, 285–300.
Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling, 6, 39–62.
Yu, G., & Qi, X. (2004). Disruption management: Framework, models and applications. Singapore/River Edge: World Scientific.
Zhang, H., & Graves, S. C. (1997). Cyclic scheduling in a stochastic environment. Operations Research, 45, 894–903.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cai, X., Wu, X., Zhou, X. (2014). Stochastic Machine Breakdowns. In: Optimal Stochastic Scheduling. International Series in Operations Research & Management Science, vol 207. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7405-1_4
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7405-1_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7404-4
Online ISBN: 978-1-4899-7405-1
eBook Packages: Business and EconomicsBusiness and Management (R0)