Skip to main content
Log in

Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider a single machine due date assignment scheduling problem with job-dependent aging effects and a deteriorating maintenance activity, where due dates are assigned using the SLK due date determination method. We need to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowance and the sequence of jobs to minimize total earliness, tardiness and common flow allowance cost. We show that the problem remains polynomially solvable under the proposed model.

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. Adamopoulos G.I., Pappis C.P.: Single machine scheduling with flow allowances. J. Oper. Res. Soc. 47, 1280–1285 (1996)

    MATH  Google Scholar 

  2. Brucker P.: Scheduling algorithms, 3rd edn. Springer, Berlin (2001)

    Book  MATH  Google Scholar 

  3. Cheng T.C.E., Podolsky S.: Just-in-time manufacturing: an introduction. Chapman & Hall, London (1996)

    Google Scholar 

  4. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gordon V.S., Proth J.M., Chu C.: A survey of the state-of-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139, 1–25 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Graves G.H., Lee C.Y.: Scheduling maintenance and semiresumable jobs on a single machine. Nav. Res. Logist. 46, 845–863 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hardy G.H., Littlewood J.E., Polya G.: Inequalities. Cambridge University Press, Cambridge (1967)

    Google Scholar 

  8. Lee C.Y., Chen Z.L.: Scheduling jobs and maintenance activities on parallel machine. Nav. Res. Logist. 47, 145–165 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lee C.Y., Lin C.S.: Single-machine scheduling with maintenance and repair rate-modifying activity. Eur. J. Oper. Res. 135, 493–513 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Mosheiov G., Sidney J.B.: New results on sequencing with rate modification. INFOR 41, 155–163 (2004)

    Google Scholar 

  14. Mosheiov G., Sarig A.: Scheduling a maintenance activity and due-window assignment on a single machine. Comput. Oper. Res. 36, 2541–2545 (2009)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  16. Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs (1982)

    MATH  Google Scholar 

  17. Qi X., Chen T., Tu F.: Scheduling the maintenance on a single machines. J. Oper. Res. Soc. 50, 1071–1078 (1999)

    MATH  Google Scholar 

  18. Wang X.Y., Wang M.Z.: Single machine common flow allowance scheduling with a rate-modifying activity. Comput. Ind. Eng. 59, 898–902 (2010)

    Article  Google Scholar 

  19. Zhao C., Tang H.: A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity. Comput. Oper. Res. 39, 1300–1303 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Yang S.J., Yang D.L.: Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega 38, 528–533 (2010)

    Article  Google Scholar 

  22. Yang S.J., Yang D.L., Cheng T.C.E.: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput. Oper. Res. 37, 1510–1514 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ji-Bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ji, P., Li, G., Huo, Y. et al. Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity. Optim Lett 8, 1389–1400 (2014). https://doi.org/10.1007/s11590-012-0504-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0504-6

Keywords

Navigation