Skip to main content
SpringerLink
Log in

Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Scheduling with learning effect and deteriorating jobs has become more popular. However, most of the research assume that the setup time is negligible or a part of the job processing time. In this paper, we propose a model where the deteriorating jobs, the learning effect, and the setup times are present simultaneously. Under the proposed model, the setup time is past-sequence-dependent and the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. We provide the optimal schedules for some single-machine problems.

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

  1. Alidaee B., Womer N.K.: Scheduling with time dependent processing times: Review and extensions. J. Oper. Res. Soc. 50, 711–720 (1999)

    MATH  Google Scholar 

  2. Biskup D.: A state-of-the-art review on scheduling with learning effect. Eur. J. Oper. Res. 188, 315–329 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Biskup D., Herrmann J.: Single-machine scheduling against due dates with past-sequence-dependent setup times. Eur. J. Oper. Res. 191, 587–592 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng T.C.E., Ding Q., Lin B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng T.C.E., Lee W.C., Wu C.C.: Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput. Ind. Eng. 58, 326–331 (2010)

    Article  Google Scholar 

  6. Cheng T.C.E., Wu C.C., Lee W.C.: Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 54, 972–982 (2008)

    Article  Google Scholar 

  7. Gawiejnowicz S.: Time-Dependent Scheduling, Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin (2008)

    Google Scholar 

  8. Huang X., Wang M.Z., Wang J.B.: Single-machine group scheduling with both learning effects and deteriorating jobs. Comput. Ind. Eng. 60, 750–754 (2011)

    Article  Google Scholar 

  9. Janiak A., Rudek R.: A note on a makespan minimization problem with a multi-abilities learning effect. OMEGA Int. J. Manag. Sci. 38, 213–217 (2010)

    Article  Google Scholar 

  10. Ji M., Cheng T.C.E.: Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur. J. Oper. Res. 188, 342–347 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ji M., Cheng T.C.E.: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan. Eur. J. Oper. Res. 202, 90–98 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  12. Koulamas C., Kyparisis G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187, 1045–1049 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kuo W.H., Yang D.L.: Single machine scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett. 102, 22–26 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lai P.J., Lee W.C.: Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. Omega Int. J. Manag. Sci. 39, 467–471 (2011)

    Article  MathSciNet  Google Scholar 

  15. Lai, P.J., Wu, C.C., Lee, W.C.: Single-machine scheduling with logarithm deterioration. Optim. Lett. doi:10.1007/s11590-011-0362-7 (2011)

  16. Lee W.C.: A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Bus. Econ. 3, 83–89 (2004)

    Google Scholar 

  17. Lee W.C.: Scheduling with general position-based learning curves. Inf. Sci. 181, 5515–5522 (2011)

    Article  MATH  Google Scholar 

  18. Pinedo M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Upper Saddle River, NJ (2002)

    Google Scholar 

  19. Rudek R.: Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect. Comput. Ind. Eng. 61, 20–31 (2011)

    Article  Google Scholar 

  20. Sun L.: Single-machine scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 57, 843–846 (2009)

    Article  Google Scholar 

  21. Voutsinas T.G., Pappis C.P.: A branch-and-bound algorithm for single-machine scheduling with deteriorating value of jobs. Math. Comput. Model. 52, 55–61 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wang J.B.: A note on scheduling problems with learning effect and deteriorating jobs. Int. J. Syst. Sci. 37, 827–833 (2006)

    Article  MATH  Google Scholar 

  23. Wang J.B.: Single-machine scheduling problems with the effects of learning and deterioration. OMEGA Int. J. Manag. Sci. 35, 397–402 (2007)

    Article  Google Scholar 

  24. Wang J.B., Guo Q.: A due-date assignment problem with learning effect and deteriorating jobs. Appl. Math. Model. 34, 309–313 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  25. Wang X., Cheng T.C.E.: Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur. J. Oper. Res. 178, 57–70 (2007)

    Article  MATH  Google Scholar 

  26. Wang J.B., Sun L.H., Sun L.Y.: Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect. Comput. Math. Appl. 60, 2673–2678 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  27. Wang J.B., Wang D., Zhang G.D.: Single-machine scheduling problems with both deteriorating jobs and learning effects. Appl. Math. Model. 34, 2831–2839 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  28. Wang, J.B., Wang, M.Z.: Single-machine scheduling with nonlinear deterioration. Optim. Lett. doi:10.1007/s11590-010-0253-3 (2010)

  29. Xu Z., Sun L., Gong J.: Worst-case analysis for flow shop scheduling with learning effect. Int. J. Prod. Econ. 113, 748–753 (2008)

    Article  Google Scholar 

  30. Yin N., Wang J.B., Wang D., Wang L.Y., Wang X.Y.: Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 46, 707–714 (2010)

    Article  MathSciNet  Google Scholar 

  31. Yin Y.Q., Xu D.H.: Some single-machine scheduling problems with general effects of learning and deterioration. Comput. Math. Appl. 61, 100–108 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  32. Zhao C.L., Tang H.Y.: A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. Optim. Lett. 5, 183–190 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, Taichung, Taiwan

    Wen-Chiung Lee

Authors
  1. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Chiung Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, WC. Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning. Optim Lett 8, 135–144 (2014). https://doi.org/10.1007/s11590-012-0481-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0481-9

Keywords

Search

Navigation