Skip to main content
SpringerLink
Log in

Scheduling deteriorating jobs to minimize the makespan on a single machine

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

Abstract

Machine scheduling problems with deteriorating jobs have received increasing attention in recent years, mostly focusing on the linear deterioration models. However, if certain maintenance procedures fail to be completed prior to a prespecified deadline, jobs will require extra time for successful accomplishment in some situations. Therefore, this paper addresses a single-machine problem where the objective is to minimize the makespan under the piecewise linear deterioration model. A branch-and-bound algorithm and two heuristic algorithms are provided to search for the optimal solution and near-optimal solutions, respectively. Computational results are also presented to evaluate the performance of the proposed algorithms.

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. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498. doi:10.1287/opre.38.3.495

    Article  MATH  Google Scholar 

  2. Kunnathur AS, Gupta SK (1990) Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Oper Res 47(1):56–64. doi:10.1016/0377-2217(90)90089-T

    Article  MATH  MathSciNet  Google Scholar 

  3. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659. doi:10.1016/0305-0548(94)90080-9

    Article  MATH  Google Scholar 

  4. Cheng TCE, Ding Q (1998) The complexity of scheduling starting time dependent tasks with release times. Inf Process Lett 65(2):75–79. doi:10.1016/S0020-0190(97)00195-6

    Article  MathSciNet  Google Scholar 

  5. Wang JB, Xia ZQ (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69. doi:10.1016/j.ipl.2004.12.018

    Article  MathSciNet  Google Scholar 

  6. Zhao CL, Tang HY (2005) Single machine scheduling problems with deteriorating jobs. Appl Math Comput 161:865–874. doi:10.1016/j.amc.2003.12.073

    Article  MATH  MathSciNet  Google Scholar 

  7. Lee WC, Wu CC, Liu HC (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1421-9

  8. Shiau YR, Lee WC, Wu CC, Chang CM (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782. doi:10.1007/s00170-006-0646-8

    Article  Google Scholar 

  9. Toksari MD, Güner E (2008) 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 

  10. Wang JB, Lin L, Shan F (2008) 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 

  11. Kubiak W, van de Velde S (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Logistics 45:511–523. doi:10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6

    Article  MATH  Google Scholar 

  12. Cheng TCE, Ding Q (2001) Single-machine scheduling with step-deteriorating processing times. Eur J Oper Res 134:623–630. doi:10.1016/S0377-2217(00)00284-8

    Article  MATH  MathSciNet  Google Scholar 

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

  14. Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13. doi:10.1016/S0377-2217(02)00909-8

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. Wang JB, Cheng TCE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pacific J Oper Res 24(2):245–261. doi:10.1142/S021759590700122X

    Article  MathSciNet  Google Scholar 

  17. Wang JB (2006) A note on scheduling problems with learning effect and deteriorating jobs. Int J Syst Sci 37(2):827–833. doi:10.1080/00207720600879260

    Article  MATH  Google Scholar 

  18. Wang JB (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35:397–402. doi:10.1016/j.omega.2005.07.008

    Article  Google Scholar 

  19. Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178:57–70. doi:10.1016/j.ejor.2006.01.017

    Article  MATH  MathSciNet  Google Scholar 

  20. Wang JB, Gao WJ, Wang LY, Wang D (2009) Single machine group scheduling with general linear deterioration to minimize the makespan. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1667-2

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

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

  23. Cai JY, Cai P, Zhu Y (1998) On a scheduling problem of time deteriorating jobs. J Complex 14:190–209. doi:10.1006/jcom.1998.0473

    Article  MATH  MathSciNet  Google Scholar 

  24. 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. doi:10.1287/opre.30.2.391

    Article  MATH  Google Scholar 

  25. Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680. doi:10.1126/science.220.4598.671

    Article  MathSciNet  Google Scholar 

  26. Ben-Arieh D, Maimon O (1992) Annealing method for PCB assembly scheduling on two sequential machines. Int J Comput Integr Manuf 5(6):361–367. doi:10.1080/09511929208944543

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, Taichung, Taiwan

    Chin-Chia Wu, Ling-Huei Lee & Wen-Chiung Lee

  2. Department of Industrial Engineering and System Management, Feng Chia University, Taichung, Taiwan

    Yau-Ren Shiau

Authors
  1. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yau-Ren Shiau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ling-Huei Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. 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., Shiau, YR., Lee, LH. et al. Scheduling deteriorating jobs to minimize the makespan on a single machine. Int J Adv Manuf Technol 44, 1230–1236 (2009). https://doi.org/10.1007/s00170-008-1924-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1924-4

Keywords

Search

Navigation