Skip to main content
SpringerLink
Log in

A bi-criterion single-machine scheduling problem with learning considerations

  • Published:
Acta Informatica 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.” This paper focuses on a bi-criterion single-machine scheduling problem with a learning effect. The objective is to find a sequence that minimizes a linear combination of the total completion time and the maximum tardiness. A branch-and-bound and a heuristic algorithm are proposed to search for optimal and near-optimal solutions, respectively. Computational results are also provided for the problem.

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. Biskup D (1999) Single-machine scheduling with learning considerations. European Journal of Operational Research 115: 173-178

    Article  MATH  Google Scholar 

  2. Chen CL, Bulfin RL (1993) Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research 70: 115-125

    Article  MATH  Google Scholar 

  3. Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Annals of Operation Research 98: 273-290

    Article  MathSciNet  MATH  Google Scholar 

  4. Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. European Journal of Operational Research 90: 227-237

    Article  Google Scholar 

  5. Dileepan P, Sen T (1988) Bicriterion static scheduling research for a single machine. Omega 16: 53-59

    Article  Google Scholar 

  6. Dondeti VR, Mohanty BB (1995) Minimizing average flow time on a single machine with learning and fatigue factors. In: Proceedings of the 25th Annual Meeting, pp 278-280. Southeast Region of the Decision Sciences Institute

  7. Dondeti VR, Mohanty BB (1998) Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs. European Journal of Operational Research 105: 509-524

    Article  MATH  Google Scholar 

  8. Emmons H (1975) A note on a scheduling problem with dual criteria. Naval Research Logistic Quarterly 22(2): 615-616

    MATH  Google Scholar 

  9. Fisher ML (1971) A dual algorithm for the one-machine scheduling problem. Mathematical Programming 11: 229-251

    MATH  Google Scholar 

  10. Fry TD, Armstrong RD, Lewis H (1989) A framework for single machine multiple objective sequencing research. Omega 17: 595-607

    Article  Google Scholar 

  11. Gawiejnowicz S (1996) A note on scheduling on a single processor with speed dependent on a number of executed jobs. Information Processing Letters 56: 297-300

    Article  MathSciNet  Google Scholar 

  12. Heck H, Roberts S (1972) A note on the extension of a result on scheduling with secondary criteria. Naval Research Logistic Quarterly 19(2): 403-405

    MATH  Google Scholar 

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

  14. Meilijson I, Tamir A (1984) Minimizing flow time on parallel identical processors with variable unit processing time. Operations Research 32: 440-448

    MATH  Google Scholar 

  15. Mosheiov G (2001) Scheduling problems with a learning effect. European Journal of Operational Research 132: 687-693

    Article  MATH  Google Scholar 

  16. Mosheiov G (2001) Parallel machine scheduling with a learning effect. Journal of the Operational Research Society 52: 1165-1169

    Google Scholar 

  17. Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. European Journal of Operational Research 147: 665-670

    Article  MATH  Google Scholar 

  18. Nagar A, Haddock J, Heragu S (1995) Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81: 88-104

    Article  MATH  Google Scholar 

  19. Panwalker SS, Iskander W (1977) A survey of scheduling rules. Operations Research 25: 45-61

    Google Scholar 

  20. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice Hall, Upper Saddle River, NJ

  21. Russell RS, Taylor III BW (2000) Operations management: multimedia version, 3rd edn. Prentice Hall, Upper saddle River, NJ

    Google Scholar 

  22. Sen T, Gupta SK (1983) A branch-and-bound procedure to solve a bicretirion scheduling problem. IIE Transactions 15(1): 84-88

    MATH  Google Scholar 

  23. Smith WE (1956) Various optimizers for single-stage production. Naval Research Logistic Quarterly 3(1): 59-66

    MathSciNet  MATH  Google Scholar 

  24. Van Wassenhove LN, Gelders LF (1980) Solving a bicriterion scheduling problem. European Journal of Operational Research 4: 42-48

    Article  MATH  Google Scholar 

  25. Wu CC, Lee WC, Chen T (2003) A simulated annealing approach to a single-machine scheduling problem with learning considerations (forthcoming)

  26. Wright TP (1936) Factors affecting the cost of airplanes. Journal of Aeronautical Science 3: 122-128

    MATH  Google Scholar 

  27. Yelle LE (1979) The learning curve: historical review and comprehensive survey. Decision Science 10: 302-328

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, 100 Wenhua Road, Taichung, Taiwan

    Wen-Chiung Lee, Chin-Chia Wu & Hua-Jung Sung

Authors
  1. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hua-Jung Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 21 April 2003, Accepted: 9 October 2003, Published online: 16 January 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, WC., Wu, CC. & Sung, HJ. A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40, 303–315 (2004). https://doi.org/10.1007/s00236-003-0132-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-003-0132-9

Keywords

Search

Navigation