Skip to main content
SpringerLink
Log in

Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs

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

Abstract

The paper deals with the single-machine scheduling problem with a sum-of-processing-time- based learning effect and deteriorating jobs. By the effects of sum-of-processing-time-based learning and deterioration, we mean that the processing time of a job is defined by function of its starting time and total normal processing time of jobs in front of it in the sequence. It is shown that, even with the introduction of the effects of sum-of-processing-time-based learning and deterioration to job processing times, the single-machine makespan minimization problem remains polynomially solvable.

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. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River

    MATH  Google Scholar 

  2. Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720

    Article  MATH  Google Scholar 

  3. Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13

    Article  MATH  MathSciNet  Google Scholar 

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

  5. Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243

    Article  Google Scholar 

  6. Shiau Y-R, Lee W-C, Wu C-C, Chang C-M (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782

    Article  Google Scholar 

  7. Wang J-B, Lin L, Shan F (2007) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39:808–812. doi:10.1007/s00170-007-1255-x

    Article  Google Scholar 

  8. Eren T, Guner E (2008) A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1436-2

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Wang J-B (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35:397–402

    Article  Google Scholar 

  12. Wang J-B, Cheng TCE (2007a) Scheduling problems with the effects of deterioration and learning. Asia-Pac J Oper Res 24:245–261

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Toksar MD, Guner E (2007) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol 38:801–808. doi:10.1007/s00170-007-1128-3

    Article  Google Scholar 

  15. Nembhard DA, Osothsilp N (2002) Task complexity effects on between-individual learning/forgetting variability. Int J Ind Ergon 29:297–306

    Article  Google Scholar 

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

  17. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653–659

    Article  MATH  Google Scholar 

  18. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Dalian University of Technology, Dalian, 116024, People’s Republic of China

    Li-Yan Wang & En-Min Feng

  2. School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, People’s Republic of China

    Li-Yan Wang, Ji-Bo Wang, Dan Wang, Na Yin & Xue Huang

Authors
  1. Li-Yan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Na Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xue Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. En-Min Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, LY., Wang, JB., Wang, D. et al. Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs. Int J Adv Manuf Technol 45, 336–340 (2009). https://doi.org/10.1007/s00170-009-1950-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-1950-x

Keywords

Search

Navigation