Skip to main content
Log in

Note on “A unique integer mathematical model for scheduling deteriorating jobs with rate-modifying activities on a single machine”

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

Abstract

In this note, we study scheduling problems with simultaneous considerations of deteriorating jobs and rate-modifying activities on a single machine. The job-dependent deterioration effect and the job-independent deterioration effect models are examined with the objective of minimizing the makespan. We propose polynomial time solutions for all the studied problems.

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.

References

  1. Brucker P (2001) Scheduling algorithms. Springer-Verlag Inc., Berlin

    Book  MATH  Google Scholar 

  2. Gordon VS, Tarasevich AA (2009) A note: common due date assignment for a single machine scheduling with the rate-modifying activity. Comput Oper Res 36:325–328

    Article  MathSciNet  MATH  Google Scholar 

  3. Hardy GH, Littlewood JE, Polya G (1967) Inequalities. Cambridge University Press, London

    Google Scholar 

  4. He Y, Ji M, Cheng TCE (2005) Scheduling with a restricted rate-modifying activity. Nav Res Logist 52:361–369

    Article  MathSciNet  MATH  Google Scholar 

  5. Hsu CJ, Cheng TCE, Yang DL (2011) Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf Sci 181:4799–4803

    Article  MathSciNet  MATH  Google Scholar 

  6. Huang X, Wang JB, Wang XR (2010) A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. Int J Adv Manuf Technol 47:1225–1230

    Article  Google Scholar 

  7. Ji M, Cheng TCE (2008) Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur J Oper Res 188:342–347

    Article  MathSciNet  MATH  Google Scholar 

  8. Ji M, Cheng TCE (2010) Scheduling with job-dependent learning effects and multiple rate-modifying activities. Inf Process Lett 110:460–463

    Article  MathSciNet  MATH  Google Scholar 

  9. Kang LY, Ng CT (2007) A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int J Prod Econ 109:180–184

    Article  Google Scholar 

  10. Lee CY, Leon VJ (2001) Machine scheduling with a rate-modifying activity. Eur J Oper Res 128:119–128

    Article  MathSciNet  MATH  Google Scholar 

  11. Lee CY, Lin CS (2001) Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Oper Res 135:493–513

    Article  MathSciNet  MATH  Google Scholar 

  12. Lee WC, Wu CC (2008) Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Appl Math Model 32:362–373

    Article  MathSciNet  MATH  Google Scholar 

  13. Lee WC, Wu CC, Liu HC (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol 40:1053–1056

    Article  Google Scholar 

  14. Lee WC, Wu CC, Wen CC, Chung YH (2008) A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput Ind Eng 54:737–749

    Article  Google Scholar 

  15. Lodree EJ, Geiger CD (2010) A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration. Eur J Oper Res 201:644–648

    Article  MathSciNet  MATH  Google Scholar 

  16. Mosheiov G, Oron D (2006) Due-date assignment and maintenance activity scheduling problem. Math Comput Model 44:1053–1057

    Article  MathSciNet  MATH  Google Scholar 

  17. Mosheiov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882–887

    Article  MATH  Google Scholar 

  18. Ozturkoglu Y, Bulfin RL (2011) A unique integer mathematical model for scheduling deteriorating jobs with rate-modifying activities on a single machine. Int J Adv Manuf Technol 57:753–762

    Article  Google Scholar 

  19. Rudek R (2011) Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3481-5

  20. Rudek A, Rudek R (2011) On flowshop scheduling problems with the aging effect and resource allocation. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3809-1

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

    Article  Google Scholar 

  22. Wang D, Wang JB (2010) Single-machine scheduling with simple linear deterioration to minimize earliness penalties. Int J Adv Manuf Technol 46:285–290

    Article  Google Scholar 

  23. Wang JB (2010) Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan. Int J Adv Manuf Technol 48:719–723

    Article  Google Scholar 

  24. Wang JB, Wang LY, Wang D, Wang XY (2009) Single-machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol 43:805–809

    Article  Google Scholar 

  25. Wang XY, Wang MZ (2010) Single machine common flow allowance scheduling with a rate-modifying activity. Comput Ind Eng 59:898–902

    Article  Google Scholar 

  26. Wu CC, Shiau YR, Lee LH, Lee WC (2009) Scheduling deteriorating jobs to minimize the makespan on a single machine. Int J Adv Manuf Technol 40:1230–1236

    Article  Google Scholar 

  27. Zhao CL, Tang HY, Cheng CD (2009) Two-parallel machines scheduling with rate-modifying activities to minimize total completion time. Eur J Oper Res 198:354–357

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dar-Li Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, SJ., Yang, DL. Note on “A unique integer mathematical model for scheduling deteriorating jobs with rate-modifying activities on a single machine”. Int J Adv Manuf Technol 64, 1759–1764 (2013). https://doi.org/10.1007/s00170-012-4139-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4139-7

Keywords

Navigation