Skip to main content
Log in

A bicriteria parallel machine scheduling with a learning effect

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the “learning effect.” In this paper a bicriteria m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes a weighted sum of total completion time and total tardiness. Total completion time and total tardiness are widely used performance measures in scheduling literature. To solve this scheduling problem, a mathematical programming model is formulated.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Mosheiov G (2001) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165–1169

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85–93

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Eren T, Güner E (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31(7):1351–1361

    Article  MATH  Google Scholar 

  8. 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 

  9. Eren T, Güner E (in print) A bicriteria scheduling with a learning effect: total completion time and total tardiness. Infor

  10. Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85–93

    Article  Google Scholar 

  11. Eren T, Güner E (2004) Minimizing mean flow time in a flowshop scheduling with learning effect. Journal of the Faculty of Engineering and Architecture of Gazi University 19:119–124. (In Turkish)

    Google Scholar 

  12. Eren T, Güner E (in print) A bicriteria flowshop scheduling with a learning effect. Appl Math Model

  13. Du J, Leung JYT (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483–495

    Article  MATH  MathSciNet  Google Scholar 

  14. Hsu YS, Lin BNT (2003) Minimizing of maximum lateness under linear deterioration. Omega 31:459–469

    Article  Google Scholar 

  15. http://kku.edu.tr/∼teren/

  16. Heizer J, Render B (2001) Operations management, sixth edn. Prentice-Hall, Upper Saddle River

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tamer Eren.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eren, T., Güner, E. A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol 40, 1202–1205 (2009). https://doi.org/10.1007/s00170-008-1436-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1436-2

Keywords

Navigation