Advertisement

Journal of Scheduling

, Volume 14, Issue 2, pp 173–186 | Cite as

Scheduling deteriorating jobs on a single machine subject to breakdowns

  • Xiaoqiang Cai
  • Xianyi Wu
  • Xian Zhou
Article

Abstract

We investigate the problem of scheduling a set of jobs to minimize the expected makespan or the variance of the makespan. The jobs are subject to deteriorations which are expressed as linear increments of the processing requirements. The machine is subject to preemptive-resume breakdowns with exponentially distributed uptimes and downtimes. It has been well known in the classical models that the expectation and variance of the makespan of deteriorating jobs can be minimized analytically by an index policy if no machine breakdowns are involved. Such basic features, however, change dramatically when breakdowns and deteriorations are present together. In this paper, we derive conditions for jobs to be processible in the sense that they will be eventually completed, and the characteristics of the time that a job occupies the machine. We further find that the expected makespan can still be minimized by a simple index policy that is independent of the breakdown process, but this is no longer the case for the variance of the makespan.

Keywords

Stochastic scheduling Machine breakdowns Preemptive-resume Deteriorations Processibility of job 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50, 711–720. Google Scholar
  2. Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81, 81–84. CrossRefGoogle Scholar
  3. 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. CrossRefGoogle Scholar
  4. Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495–498. CrossRefGoogle Scholar
  5. Cai, X., & 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. CrossRefGoogle Scholar
  6. Cai, X., & Zhou, X. (2000). Asymmetric earliness-tardiness scheduling with exponential processing times on an unreliable machine. Annals of Operations Research, 98, 313–331. CrossRefGoogle Scholar
  7. Cai, X., Sun, X., & Zhou, X. (2003). Stochastic scheduling with preemptive-repeat machine breakdowns to minimize the expected weighted flowtime. Probability in the Engineering and Informational Sciences, 17, 467–485. CrossRefGoogle Scholar
  8. Cai, X., Sun, X., & Zhou, X. (2004). Stochastic scheduling subject to machine breakdowns: the preemptive-repeat model with discounted reward and other criteria. Naval Research Logistics, 51, 800–817. CrossRefGoogle Scholar
  9. Cai, X., Wu, X., & Zhou, X. (2005). Dynamically optimal policies for stochastic scheduling subject to preemptive-repeat machine breakdowns. IEEE Transactions on Automation Science and Engineering, 2, 158–172. CrossRefGoogle Scholar
  10. Cai, X., Wu, X., & Zhou, X. (2009). Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information. Operations Research. Published online before print, doi: 10.1287/opre.1080.0660.
  11. Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1–13. CrossRefGoogle Scholar
  12. 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. CrossRefGoogle Scholar
  13. Glazebrook, K.D. (1984). Scheduling stochastic jobs on a single machine subject to breakdowns. Naval Research Logistics Quarterly, 31, 251–264. CrossRefGoogle Scholar
  14. Glazebrook, K.D. (1987). Evaluating the effects of machine breakdowns in scheduling stochastic problems. Naval Research Logistics, 34, 319–335. CrossRefGoogle Scholar
  15. Glazebrook, K. D. (1991). On nonpreemptive policies for stochastic single-machine scheduling with breakdowns. Probability in the Engineering and Informational Sciences, 5, 77–87. CrossRefGoogle Scholar
  16. Glazebrook, K. D., Assell, P. S., Dunn, R. T., & Lumley, R. R. (2004). On the optimal service to impatient tasks. Journal of Applied Probability, 41, 51–72. CrossRefGoogle Scholar
  17. Li, W., Braun, W. J., & Zhao, Y. Q. (1998). Stochastic scheduling on a repairable machine with erlang uptime distribution. Advances in Applied Probability, 30, 1073–1088. CrossRefGoogle Scholar
  18. Mittenthal, J., & Raghavachari, M. (1993). Stochastic single machine scheduling with quadratic early-tardy penalties. Operations Research, 41, 786–796. CrossRefGoogle Scholar
  19. Niño-Mora, J. (2001). Restless bandits, partial conservation laws and indexability. Advances in Applied Probability, 33, 76–98. CrossRefGoogle Scholar
  20. Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall. Google Scholar
  21. 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. CrossRefGoogle Scholar
  22. 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. CrossRefGoogle Scholar
  23. 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. CrossRefGoogle Scholar
  24. Whittle, P. (1988). Restless bandits: Activity allocation in a changing world. Journal of Applied Probability, 25, 287–298. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongPok Fu LamHong Kong
  2. 2.Department of Statistics and Actuarial Science, and Center of International Finance and Risk ManagementEast China Normal UniversityShanghaiChina
  3. 3.Department of Actuarial StudiesMacquarie UniversitySydneyAustralia

Personalised recommendations