Skip to main content
Log in

Minimizing the total weighted completion time on a single machine under linear deterioration

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

Abstract

This paper investigates a single-machine problem in which processing times of jobs are start time dependent and the aim is to minimize the total weighted completion time. Recent research has shown the complexity of this problem to be NP-hard; however, no optimal or heuristic algorithms have been proposed. In this paper, we explore the exact solution and propose several heuristic algorithms derived based on the impacts of model parameters. The effects of normal processing times and deterioration rates are also studied.

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. Kubiak W, van de Velde SL (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Logist 45:511–523

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38 :495–498

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

  6. Sundararaghavan PS, Kunnathur AS (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394–403

    Article  MATH  Google Scholar 

  7. Mosheiov G (1996) Λ-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191

    Article  MATH  Google Scholar 

  8. Bachman A, Cheng TCE, Janiak A, Ng CT (2002) Scheduling start time dependent jobs to minimize the total weighted completion time. J Oper Res Soc 53(6): 688–693

    Article  MATH  MathSciNet  Google Scholar 

  9. Bachman A, Janiak A, Kovalyov MY (2002) Minimizing the total weighted completion time of deteriorating jobs. Inf Process Lett 81(2):81–84

    Article  MATH  MathSciNet  Google Scholar 

  10. Chen JS (2005) A branch and bound for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol (in press)

  11. Das SR, Canel C (2005) An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. Int J Prod Econ 97:247–262

    Article  Google Scholar 

  12. Gupta AK, Sivakumar AI (2005) Single machine scheduling with multiple objectives in semiconductor manufacturing. Int J Adv Manuf Technol 26:950–958

    Article  Google Scholar 

  13. Gupta AK, Sivakumar AI (2005) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11/12):1163–1169

    Google Scholar 

  14. Bachman A, Janiak A (2000) Minimizing maximum lateness under linear deterioration. Eur J Oper Res 126:557–566

    Article  MATH  MathSciNet  Google Scholar 

  15. Hsu YS, Lin BMT (2003) Minimization of maximum lateness under linear deterioration. OMEGA Int J Manage S 31:459–469

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the editor and the referees, whose constructive comments have led to a substantial improvement in the presentation of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chin-Chia Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, CC., Lee, WC. & Shiau, YR. Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33, 1237–1243 (2007). https://doi.org/10.1007/s00170-006-0565-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0565-8

Keywords

Navigation