Skip to main content
Log in

Minimizing total load on parallel machines with linear deterioration

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

Abstract

We study a scheduling problem with linear deterioration of job processing times. We consider parallel identical machines. The objective is minimum total load, i.e., minimum total processing times on all the machines. We propose a simple heuristic of a greedy type for this NP-hard problem. A lower bound based on the geometric mean of the job deterioration factors is also introduced. The greedy heuristic is shown to guarantee an optimal solution for small size problems, and our numerical tests indicate that in general it produces very close-to-optimal schedules.

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. Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50, 711–720 (1999)

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Chen, Z.-L.: A note on single-processor scheduling with time-dependent execution times. Oper. Res. Lett. 17, 127–129 (1995)

    Article  Google Scholar 

  4. Cheng, T.C.E., Ding, Q.: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine. Comput. Oper. Res. 30, 51–62 (2003)

    Article  MathSciNet  Google Scholar 

  5. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MathSciNet  Google Scholar 

  6. Fiszman, S., Mosheiov, G.: Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. Inf. Process. Lett. 132, 39–43 (2018)

    Article  MathSciNet  Google Scholar 

  7. Gawiejnowicz, S.: Time-Dependent Scheduling. Springer, Berlin (2008)

    Book  Google Scholar 

  8. Gawiejnowicz, S., Kurc, W.: Structural properties of time-dependent scheduling problems with the lp norm objective. Omega 57, 196–202 (2015)

    Article  Google Scholar 

  9. Gawiejnowicz, S., Kurc, W., Pankowska, L.: Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences. Discrete Appl. Math. 154, 2150–2166 (2006)

    Article  MathSciNet  Google Scholar 

  10. Kubale, M., Ocetkiewicz, K.M.: A new optimal algorithm for a time-dependent scheduling problem. Control Cybern. 38, 713–721 (2009)

    MathSciNet  MATH  Google Scholar 

  11. Kyparisis, G.J., Koulamas, C.: On index priority sequencing rules for scheduling with time-dependent job processing times. Oper. Res. Lett. 42, 445–448 (2013)

    Article  MathSciNet  Google Scholar 

  12. Lin, G.-H., Yao, E.-Y., He, Y.: Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times. Oper. Res. Lett. 22, 75–81 (1998)

    Article  MathSciNet  Google Scholar 

  13. Mor, B., Mosheiov, G., Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Sched. (2019). https://doi.org/10.1007/s10951-019-00612-y

    Article  Google Scholar 

  14. Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Oper. Res. 39, 979–991 (1991)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  16. Mosheiov, G.: Multi-machine scheduling with linear deterioration. INFOR 36, 205–214 (1998)

    Google Scholar 

  17. Mosheiov, G.: A note: multi-machine scheduling with general position-based deterioration to minimize total load. Int. J. Prod. Econ. 135, 523–535 (2012)

    Article  Google Scholar 

  18. Ocetkiewicz, K.M.: A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem. Eur. J. Oper. Res. 203, 316–320 (2010)

    Article  MathSciNet  Google Scholar 

  19. Ocetkiewicz, K.M.: Partial dominated schedules and minimizing the total completion time of deteriorating jobs. Optimization 62, 1341–1356 (2013)

    Article  MathSciNet  Google Scholar 

  20. Oron, D.: Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Comput. Oper. Res. 35, 2071–2078 (2006)

    Article  MathSciNet  Google Scholar 

  21. Wu, C.-C., Shiau, Y.-R., Lee, W.-C.: Single machine group scheduling problems with deterioration consideration. Comput. Oper. Res. 35, 1652–1659 (2006)

    Article  Google Scholar 

  22. Yu, X., Zhang, Y., Huang, K.: Multi-machine scheduling with general position-based deterioration to minimize total load revisited. Inf. Process. Lett. 114, 399–404 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The second author was supported by the Charles I. Rosen Chair of Management, and by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gur Mosheiov.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mor, B., Mosheiov, G. Minimizing total load on parallel machines with linear deterioration. Optim Lett 14, 771–779 (2020). https://doi.org/10.1007/s11590-019-01526-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-019-01526-6

Keywords

Navigation