Skip to main content
SpringerLink
Log in

A note on single-machine scheduling with learning effect and an availability constraint

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

Abstract

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.” However, most of the papers assume that the machine is available at all times. In reality, the machine might become unavailable due to machine breakdowns or preventive maintenance during the scheduling period. Motivated by this, single-machine scheduling problems with considerations of the learning effect and machine availability are considered in this paper. It is shown that the shortest processing time rule provides the optimal schedules for the makespan and the total completion time minimization problems when jobs are assumed to be resumable. Moreover, mixed integer programming techniques are used to solve the problems when jobs are non-resumable.

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

References

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

    Article  MATH  Google Scholar 

  2. Heiser J, Render B (1999) Operations management, 5th edn. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  3. Russell R, Taylor BW (2000) Operations management: multimedia version, 3rd edn. Prentice-Hall, Upper Saddle River, NJ

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Bagchi UB (1989) Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Oper Res 37:118−125

    MathSciNet  MATH  Google Scholar 

  6. Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391−399

    Article  MATH  Google Scholar 

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

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

  9. Schmidt G (1984) Scheduling on semi-identical processors. Zeitschrift für Oper Res 28:153−162

    Article  MATH  Google Scholar 

  10. Lee CY (1996) Machine scheduling with an availability constraint. J Global Optim 9:395−416

    Article  MathSciNet  MATH  Google Scholar 

  11. Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1−15

    Article  MATH  Google Scholar 

  12. Lee CY, Liman SD (1992) Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29:375−282

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the editor and two anonymous referees whose constructive comments have led to a substantial improvement in the presentation of the paper. This work is supported by the National Science Council of Taiwan, Republic of China, under grant number NSC 93-2213-E-035-017.

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, Taiwan, Republic of China

    Chin-Chia Wu & Wen-Chiung Lee

Authors
  1. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

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

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0469-7

Keywords

Search

Navigation