Skip to main content
SpringerLink
Log in

Single-machine scheduling with both deterioration and learning effects

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers a single-machine scheduling problem with both deterioration and learning effects. The objectives are to respectively minimize the makespan, the total completion times, the sum of weighted completion times, the sum of the kth power of the job completion times, the maximum lateness, the total absolute differences in completion times and the sum of earliness, tardiness and common due-date penalties. Several polynomial time algorithms are proposed to optimally solve the problem with the above objectives.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society, 50, 711–729.

    Article  Google Scholar 

  • Bachman, A., & Janiak, A. (2000). Minimizing maximum lateness under linear deterioration. European Journal of Operational Research, 126, 557–566.

    Article  Google Scholar 

  • Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55, 257–264.

    Article  Google Scholar 

  • Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81, 81–84.

    Article  Google Scholar 

  • Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173–178.

    Article  Google Scholar 

  • Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315–329.

    Article  Google Scholar 

  • Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495–498.

    Article  Google Scholar 

  • Cheng, T. C. E., Ding, Q., Kovalyov, M. Y., Bachman, A., & Janiak, A. (2003). Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics, 50, 531–532.

    Article  Google Scholar 

  • Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004a). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1–13.

    Article  Google Scholar 

  • Cheng, T. C. E., Kang, L., & Ng, C. T. (2004b). Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 55, 198–203.

    Article  Google Scholar 

  • Cheng, T. C. E., Wu, C. C., & Lee, W. C. (2008). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 54, 972–982.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Mathematics, 5, 287–326.

    Article  Google Scholar 

  • Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities. London: Cambridge University Press.

    Google Scholar 

  • Inderfurth, K., Janiak, A., Kovalyov, M. Y., & Werner, F. (2006). Batching work and rework processes with limited deterioration of reworkables. Computers & Operations Research, 33, 1595–1605.

    Article  Google Scholar 

  • Janiak, A., & Kovalyov, M. Y. (2006). Job sequencing with exponential functions of processing times. Informatica, 17, 13–24.

    Google Scholar 

  • Janiak, A., & Mikhail, K. Y. (2006). Scheduling deteriorating jobs. In A. Janiak (Ed.), Scheduling in computer and manufacturing systems (pp. 12–25). Warszawa, WKL.

  • Janiak, A., & Rudek, R. (2006). Scheduling problems with position dependent job processing times. In A. Janiak (Ed.), Scheduling in computer and manufacturing systems (pp. 26–38). Warszawa, WKL.

  • Janiak, A., & Rudek, R. (2007). The learning effect: Getting to the core of the problem. Information Processing Letters, 103, 183–187.

    Article  Google Scholar 

  • Janiak, A., & Rudek, R. (2008a). A new approach to the learning effect: Beyond the learning curve restrictions. Computers & Operations Research, 35, 3727–3736.

    Article  Google Scholar 

  • Janiak, A., & Rudek, R. (2008b). Viewpoint on: Complexity results for single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 59, 1430.

    Article  Google Scholar 

  • Janiak, A., & Rudek, R. (2008c). Experience based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man, and Cybernetics – Part A. doi:10.1109/TSMCA.2008.2010757.

    Google Scholar 

  • Janiak, A., Janiak, W., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers and Industrial Engineering, 56, 1301–1308.

    Article  Google Scholar 

  • Kanet, J. J. (1981). Minimizing variation of Flow Time in Single Machine Systems. Management Science, 27, 1453–1459.

    Article  Google Scholar 

  • Kunnathur, A. S., & Gupta, S. K. (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research, 47, 56–64.

    Article  Google Scholar 

  • Kuo, W. H., & Yang, D. L. (2006a). Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33, 2099–2112.

    Article  Google Scholar 

  • Kuo, W. H., & Yang, D. L. (2006b). Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174(2), 1184–1190.

    Article  Google Scholar 

  • Kuo, W. H., & Yang, D. L. (2007). Single machine scheduling with past-sequence-dependent setup times and learning effects. Information Processing Letters, 102, 22–26.

    Article  Google Scholar 

  • Lee, W. C. (2004). A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3, 83–89.

    Google Scholar 

  • Lee, W. C., Wu, C. C., & Sung, H. J. (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40, 303–315.

    Article  Google Scholar 

  • Lin, B. M. T. (2007). Complexity results for single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 58, 1099–1102.

    Article  Google Scholar 

  • Mosheiov, G. (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979–991.

    Article  Google Scholar 

  • Mosheiov, G. (1994). Scheduling deteriorating jobs under simple linear deterioration. Computers and Operations Research, 21, 653–659.

    Article  Google Scholar 

  • Mosheiov, G. (1995). Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine. Computers and Industrial Engineering, 28, 869–879.

    Article  Google Scholar 

  • Mosheiov, G. (1996). Λ-shape policies for schedule deteriorating jobs. Journal of the Operational Research Society, 47, 1184–1191.

    Article  Google Scholar 

  • Mosheiov, G. (2001). Scheduling problems with learning effect. European Journal of Operational Research, 132, 687–693.

    Article  Google Scholar 

  • Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665–670.

    Article  Google Scholar 

  • Ng, C. T., Cheng, T. C. E., Bachman, A., & Janiak, A. (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters, 81, 327–333.

    Article  Google Scholar 

  • Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391–399.

    Article  Google Scholar 

  • Townsend, W. (1978). The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science, 24, 530–534.

    Article  Google Scholar 

  • Wang, J. B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35, 397–402.

    Article  Google Scholar 

  • Wang, X., & Cheng, T. C. E. (2007a). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178, 57–70.

    Article  Google Scholar 

  • Wang, J. B., & Cheng, T. C. E. (2007b). Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research, 24, 245–261.

    Article  Google Scholar 

  • Wang, J. B., Lin, L., & Shan, F. (2008). Flow shop Scheduling with effects of learning and deterioration. Journal of Applied Mathematics and Computing, 26, 367–379.

    Article  Google Scholar 

  • Wu, C. C., & Lee, W. C. (2009). A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research, 192, 343–347.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan, ROC

    Dar-Li Yang & Wen-Hung Kuo

Authors
  1. Dar-Li Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Hung Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Hung Kuo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, DL., Kuo, WH. Single-machine scheduling with both deterioration and learning effects. Ann Oper Res 172, 315–327 (2009). https://doi.org/10.1007/s10479-009-0615-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-009-0615-3

Keywords

Search

Navigation