Optimal Policies in Time-Varying Scheduling

  • Xiaoqiang Cai
  • Xianyi Wu
  • Xian Zhou
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 207)


This chapter addresses stochastic scheduling problems in which the processing times are varying during processing jobs. Two types of models, involving deteriorating processing times and learning effects respectively, are introduced and their solutions are studied. Section 9.1 deals with the model with deteriorating processing times. We formulate the mechanism of linear deterioration in Section 9.1.1, discuss the conditions for a job to be processible under deterioration and machine breakdowns in Section 9.1.2, derive the probabilistic features of the model with exponentially distributed uptimes and downtimes via Laplace transforms and differential equations in Section 9.1.3, and find optimal policies for minimizing the expected makespan in Section 9.1.4. The model with learning effects is discussed in Section 9.2. In Section 9.2.1 we consider optimal scheduling with learning effects but no machine breakdowns. The results are then extended to models with machine breakdowns in Section 9.2.2.


  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.CrossRefGoogle Scholar
  2. Anzanello, M. J., & Fogliatto, F. S. (2011). Learning curve models and applications: Literature review and research directions. International Journal of Industrial Ergonomics, 41, 573–583.CrossRefGoogle Scholar
  3. 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
  4. Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173–178.CrossRefGoogle Scholar
  5. Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315–329.CrossRefGoogle Scholar
  6. Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495–498.CrossRefGoogle Scholar
  7. Cai, X. Q., Wu, X. Y., & Zhou, X. (2007a). Single-machine scheduling with general costs under compound-type distributions, Journal of Scheduling. 10, 77–84.CrossRefGoogle Scholar
  8. Cai, X. Q., Wu, X. Y., & Zhou, X. (2011). Scheduling deteriorating jobs on a single machine subject to breakdowns. Journal of Scheduling, 14(2), 173–186.CrossRefGoogle Scholar
  9. Chang, C., & Yao, D. (1993). Rearrangement, majorization and stochastic scheduling. Mathmatics of Operations Research, 18(3), 658–684.CrossRefGoogle Scholar
  10. 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
  11. Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178, 402–407.CrossRefGoogle Scholar
  12. Kuo, W. H., & Yang, D. L. (2006). Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174, 1184–1190.CrossRefGoogle Scholar
  13. Lee, W. C. (2011). Scheduling with general position-based learning curves. Information Science, 181, 5515–5522.CrossRefGoogle Scholar
  14. Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 52, 687–693.CrossRefGoogle Scholar
  15. Righter, R. (1994). Scheduling. In M. Shaked & J. G. Shanthikumar (Eds.), Stochastic orders and their applications. Boston: Academic.Google Scholar
  16. Shaked, M., & Shanthikumar, J. G. (2007). Stochastic orders. New York: Springer.CrossRefGoogle Scholar
  17. Wang, X., & Cheng, T. C. E. (2007). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178, 57–70.CrossRefGoogle Scholar
  18. Wang, J. B., Wang, D., & Zhang, G. D. (2010). Single-machine scheduling with learning functions. Applied Mathematics and Computation, 216, 1280–1286.CrossRefGoogle Scholar
  19. Wu, C. C., & Lee, W. C. (2009). Single-machine and flowshop scheduling with a general learning effect model. Computers and Industrial Engineering, 56, 1553–1558.CrossRefGoogle Scholar
  20. Wu, X. Y., & Zhou, X. (2008). Stochastic scheduling to minimize expected maximum lateness. European Journal of Operational Research, 190, 103–115.CrossRefGoogle Scholar
  21. Wu, C. C., Yin, Y. Q., & Cheng, S. R. (2011). Some single-machine scheduling problems with a truncation learning effect. Computers and Industrial Engineering, 60, 790–795.CrossRefGoogle Scholar
  22. Yin, Y. Q., Xu, D. H., Sun, K. B., Li, H. G. (2009). Some scheduling problems with general position-dependent and time-dependent learning effects. Information Science, 179, 2416–2425.CrossRefGoogle Scholar
  23. Yin, Y. Q., Xu, D. H., & Huang, X. K. (2011). Notes on “Some single-machine scheduling problems with general position-dependent and time-dependent learning effects”. Information Science, 181, 2209–2217.CrossRefGoogle Scholar
  24. Zhang, Y. B., Wu, X. Y., & Zhou, X. (2013, to appear). Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns. Journal of Scheduling.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Xiaoqiang Cai
    • 1
  • Xianyi Wu
    • 2
  • Xian Zhou
    • 3
  1. 1.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongShatin, N.T.Hong Kong SAR
  2. 2.Department of Statistics and Actuarial ScienceEast China Normal UniversityShanghaiPeople’s Republic of China
  3. 3.Department of Applied Finance and Actuarial StudiesMacquarie UniversityNorth RydeAustralia

Personalised recommendations