Skip to main content
SpringerLink
Log in

The due date assignment scheduling problem with the deteriorating jobs and delivery time

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

This paper considers the single machine scheduling problem with three different due dates in which the actual processing time of the job is a simple deterioration function of the starting time. The goal is to minimize the total costs that contain the earliness, tardiness and due date. We prove that these problems are polynomial time solvable, and we propose the corresponding algorithms to obtain the optimal sequence and due date.

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. Jackson, J.R.: Scheduling a Production Line to Minimize Maximum Tardiness. Management Science Research Project, UCLA (1955)

    Google Scholar 

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

    Article  Google Scholar 

  3. Li, S., Ng, C.T., Yuan, J.: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. Int. J. Prod. Econ. 131(2), 747–751 (2011)

    Article  Google Scholar 

  4. Yin, Y.Q., Cheng, T.C.E., Wu, C.C., Cheng, S.R.: Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int. J. Prod. Res. 52(19), 5583–5596 (2014)

    Article  Google Scholar 

  5. Zhao, C., Hsu, C.J., Cheng, S.R., Yin, Y., Wu, C.C.: Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs. Appl. Math. Comput. 248(1), 503–510 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Wang, D.J., Yin, Y., Cheng, S.R., Cheng, T.C.E., Wu, C.C.: Due date assignment and scheduling on a single machine with two competing agents. Int. J. Prod. Res. 54(4), 1152–1169 (2016)

    Article  Google Scholar 

  7. Li, S.S., Chen, R.X.: Common due date assignment and cumulative deterioration scheduling on a single machine. Eng. Optim. 49(6), 976–989 (2017)

    Article  MathSciNet  Google Scholar 

  8. Liu, C., Fan, Y., Zhao, C., Wang, J.: Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs. J. Indus. Manag. Optim. 13(2), 713–720 (2017)

    Article  MathSciNet  Google Scholar 

  9. Karhi, S., Shabtay, D.: Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56(9), 3080–3096 (2018)

    Article  Google Scholar 

  10. Kim, H.J., Kim, E.S., Lee, J.H.: Scheduling of step-improving jobs with an identical improving rate, J. Op. Res. Soc. (2021). https://doi.org/10.1080/01605682.2021.1886616

  11. Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Indus. Eng. 14(4), 387–393 (1998)

    Article  Google Scholar 

  12. Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput. Indus. Eng. 21(6), 653–659 (1994)

    MATH  Google Scholar 

  13. Wang, J.B., Guo, Q.: A due-date assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 34(2), 303–309 (2010)

    MathSciNet  Google Scholar 

  14. Yang, S.H., Wang, J.B.: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl. Math. Comput. 217(9), 4819–4826 (2011)

    MathSciNet  MATH  Google Scholar 

  15. Bai, J., Li, Z.R., Huang, X.: Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Modell. 36(3), 1267–1274 (2012)

    Article  MathSciNet  Google Scholar 

  16. Wang, X.R., Wang, J.J.: Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl. Math. Modell. 37(4), 2388–2393 (2013)

    Article  MathSciNet  Google Scholar 

  17. Yue, Q., Wang, G.: Scheduling Deteriorating Jobs with Common Due Window Assignment. Indus. Eng. Manag. 20(6), 42–47 (2015)

    Google Scholar 

  18. Azadeh, A., Habibnejad-Ledari, H., Zadeh, S.Abdolhossein, Farahani, M.Hosseinabadi: A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. Int. J. Comput. Int. Manufact. 30(2), 292–304 (2017)

    Article  Google Scholar 

  19. Zhang, X., Liu, S.C., Yin, Y., Wu, J.B.C.C.: Single-machine scheduling problems with a learning effect matrix. Iran. J. Sci. Technol. Trans. A Sci. 42(3), 1327–1335 (2018)

    Article  MathSciNet  Google Scholar 

  20. Wu, C.C., Bai, D., Chung, I.H., Cheng, S.R., Jhwueng, D.C., Lin, W.C., Said, L.B.: A branch-and-bound and four metaheuristics for minimising total completion time for a two-stage assembly flowshop scheduling problem with learning consideration. Eng. Optim. 52(6), 1009–1036 (2020)

    Article  MathSciNet  Google Scholar 

  21. Liang, X.X., Liu, M.Q., Feng, Y.B., Wang, J.B., Wen, L.S.: Solution algorithms for single machine resource allocation scheduling with deteriorating jobs and group technology. Eng. Optim. 52(7), 1184–1197 (2020)

    Article  MathSciNet  Google Scholar 

  22. Wu, C.C., Zhang, X., Azzouz, A., Shen, W.L., Cheng, S.R., Hsu, P.H., Lin, W.C.: Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function. Eng. Optim. 53(5), 843–866 (2021)

    Article  MathSciNet  Google Scholar 

  23. Wu, C.C., Bai, D., Chen, J.H., Lin, W.C., Xing, L., Lin, J.C., Cheng, S.R.: Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. Swarm Evolut. Comput. 60, 100765 (2021)

    Article  Google Scholar 

  24. Koulamas, C., Kyparisis, G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Euro. J. Op. Res. 187, 1045–1049 (2008)

    Article  MathSciNet  Google Scholar 

  25. Liu, M.: Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl. Math. Modell. 20(6), 42–47 (2013)

    MathSciNet  Google Scholar 

  26. Yin, Y., Cheng, T.C.E., Xu, J., Cheng, S.R., Wu, C.C.: Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J. Indus. Manag. Optim. 9(2), 323–339 (2013)

    Article  MathSciNet  Google Scholar 

  27. Wu, Y.B., Wang, J.J.: Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput. Appl. 27, 937–943 (2016)

    Article  Google Scholar 

  28. Maecker, S., Shen, L.: Solving parallel machine problems with delivery times and tardiness objectives. Annals Op. Res. 285(10), 315–334 (2020)

    Article  MathSciNet  Google Scholar 

  29. Mönch, L., Shen, L.: Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. Comput. Op. Res. 127, 105126 (2021)

    Article  MathSciNet  Google Scholar 

  30. Graham, R. L., Lawler, E. L., Lenstra, J. K., Kan, A. R.: Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals Dis. Math. 5, 287–326 (1979)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Northeastern University, Shenyang, 110819, People’s Republic of China

    Jin Qian & Haiyan Han

Authors
  1. Jin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haiyan Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin Qian.

Ethics declarations

Conflict of interest

This is the first submission of this manuscript and no parts of this manuscript are being considered for publication elsewhere. All authors have approved this manuscript. No author has financial or other contractual agreements that might cause conflicts of interest. We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service or company.

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

Qian, J., Han, H. The due date assignment scheduling problem with the deteriorating jobs and delivery time. J. Appl. Math. Comput. 68, 2173–2186 (2022). https://doi.org/10.1007/s12190-021-01607-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-021-01607-9

Keywords

Search

Navigation