Skip to main content
SpringerLink
Log in

Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper considers a single-machine scheduling model with past-sequence-dependent setup times and a general learning effect. It develops a general model with setup times and learning effect considerations where the actual processing time of a job is not only a function of the total actual processing time of the jobs already processed, but also a function of the job’s scheduled position. The paper shows that the single-machine scheduling problems to minimize the makespan and the sum of the kth power of completion times are polynomially solvable under the proposed model. It further shows that the problems to minimize the total weighted completion time and the maximum lateness are polynomially solvable under certain conditions.

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. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27:219–239

    Article  Google Scholar 

  2. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MATH  MathSciNet  Google Scholar 

  3. Koulamas C, Kyparisis GJ (2008) Single-machine scheduling problems with past-sequence-dependent setup times. Eur J Oper Res 187:68–72

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Wang JB (2008) Single-machine scheduling with pastsequence- dependent setup times and time-dependent learning effect. Comput Ind Eng 55:584–591

    Article  Google Scholar 

  6. Wang JB, Jiang Y, Wang G (2009) Single machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Technol 41:1221–1226

    Article  Google Scholar 

  7. Jaber YM, Bonney M (1999) The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: past, present, and future. Int J Prod Econ 59:93–102

    Article  Google Scholar 

  8. Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

    Article  MATH  Google Scholar 

  9. Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98:273–290

    Article  MATH  MathSciNet  Google Scholar 

  10. Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132:687–692

    Article  MATH  MathSciNet  Google Scholar 

  11. Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665–670

    Article  MATH  MathSciNet  Google Scholar 

  12. Lin BMT (2007) Complexity results for single-machine scheduling with positional learning effects. J Oper Res Soc 58:1099–1102

    Article  MATH  Google Scholar 

  13. Lee WC, Wu CC, Sung HJ (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40:303–315

    Article  MATH  MathSciNet  Google Scholar 

  14. Eren T, Güner E (2009) A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol 40:1202–1205

    Article  Google Scholar 

  15. Wu CC, Lee WC (2007) A note on single-machine scheduling with learning effect and an availability constraint. Int J Adv Manuf Technol 33:540–544. doi:10.1007/s00170-006-0469-7

    Article  Google Scholar 

  16. Wu CC, Lee WC, Wang WC (2007) A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int J Adv Manuf Technol 31:743–750

    Article  Google Scholar 

  17. Toksar MD, Güner E (2009) Scheduling problems with the nonlinear effects of learning and deterioration. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2016-9

    Google Scholar 

  18. Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174:1184–1190

    Article  MATH  MathSciNet  Google Scholar 

  19. Kuo WH, Yang DL (2006) Single-machine group scheduling with a time-dependent learning effect. Comput Oper Res 33:2099–2112

    Article  MATH  Google Scholar 

  20. Koulamas C, Kyparisis GJ (2007) Single-machine and two-machine flowshop scheduling with general learning functions. Eur J Oper Res 178:402–407

    Article  MATH  MathSciNet  Google Scholar 

  21. Wang LY, Wang JB, Wang D, Yin N, Huang X, Feng EM (2009) Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs. Int J Adv Manuf Technol. doi:10.1007/s00170-009-1950-x

    Google Scholar 

  22. Wu CC, Lee WC (2008) Single-machine scheduling problems with a learning effect. Appl Math Model 32:1191–1197

    Article  MATH  MathSciNet  Google Scholar 

  23. Cheng TCE, Wu CC, Lee WC (2008) Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Inf Sci 178:2476–2487

    Article  MATH  MathSciNet  Google Scholar 

  24. Yin Y, Xu D, Sun K, Li H (2009) Some scheduling problems with general position-dependent and time-dependent learning effects. Inf Sci 179:2416–2425

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  26. Yang DL, Kuo WH (2007) Single-machine scheduling with an actual time-dependent learning effect. J Oper Res Soc 58:1348–1353

    Article  MATH  Google Scholar 

  27. Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage Sci 24:530–533

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi, 344000, China

    Yunqiang Yin & Dehua Xu

  2. School of Mathematical Sciences, Beijing Normal University, Beijing, 100875, China

    Jiayin Wang

Authors
  1. Yunqiang Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dehua Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiayin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiayin Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, Y., Xu, D. & Wang, J. Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect. Int J Adv Manuf Technol 48, 1123–1132 (2010). https://doi.org/10.1007/s00170-009-2360-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2360-9

Keywords

Search

Navigation