Skip to main content
SpringerLink
Log in

Scheduling with generalized and periodic due dates under single- and two-machine environments

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

Abstract

We consider scheduling problems such that the due date is assigned to a job, depending on its position, and the intervals between consecutive due dates are identical. The objective is to minimize the weighted number of tardy jobs or the total weighted tardiness. Both two-machine flow shop and single-machine cases are considered. We establish the computational complexity of each case, based on the relationship with the scheduling problem with a common 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. Choi, B.C., Min, Y., Park, M.J.: Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. Oper. Res. Lett. 47, 433–437 (2019)

    Article  MathSciNet  Google Scholar 

  2. Choi, B.C., Park, M.J.: Just-in-time scheduling with generalized due dates and identical due date intervals. Asia-Pac. J. Oper. Res. 35, 185004647 (2018)

    Article  MathSciNet  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Garey, M.P., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117–129 (1976)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Gao, Y., Yuan, J.: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discrete Appl. Math. 189, 49–52 (2015)

    Article  MathSciNet  Google Scholar 

  7. Gao, Y., Yuan, J.: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Oper. Res. Lett. 44, 92–95 (2016)

    Article  MathSciNet  Google Scholar 

  8. Hall, N.G.: Scheduling problems with generalized due dates. IIE Trans. 18, 220–222 (1986)

    Article  Google Scholar 

  9. Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Oper. Res. 39, 847–856 (1991)

    Article  MathSciNet  Google Scholar 

  10. Hall, N.G., Lesaoana, M., Potts, C.N.: Scheduling with fixed delivery dates. Oper. Res. 49, 134–144 (2001)

    Article  MathSciNet  Google Scholar 

  11. Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper. Res. 39, 836–846 (1991)

    Article  MathSciNet  Google Scholar 

  12. Hall, N.G., Sethi, S.P., Sriskandarajah, C.: On the complexity of generalized due date scheduling problems. Eur. J. Oper. Res. 51, 100–109 (1991)

    Article  Google Scholar 

  13. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1, 61–68 (1954)

    Article  Google Scholar 

  14. Józefowska, J., Jurisch, B., Kubiak, W.: Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. 16, 277–283 (1994)

    Article  MathSciNet  Google Scholar 

  15. Lawler, E.L., Moore, J.M.: A functional equation and its application to resource allocation and sequencing problems. Manag. Sci. 16, 77–84 (1969)

    Article  Google Scholar 

  16. Park, M.J., Choi, B.C., Min, Y., Kim, K.M.: Two-machine ordered flow shop scheduling with generalized due dates. Asia Pac. J. Oper. Res. 37, 1950032 (2020)

    Article  MathSciNet  Google Scholar 

  17. Srikandarajah, S.: A note on the generalized due dates scheduling problem. Naval Res. Logist. 37, 587–597 (1990)

    Article  MathSciNet  Google Scholar 

  18. Wan, L., Yuan, J.: Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett. 41, 363–365 (2013)

    Article  MathSciNet  Google Scholar 

  19. Yuan, J.: The NP-hardness of the single machine common due date weighted tardiness problem. J. Syst. Sci. Complex. 5, 328–333 (1992)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Ministry of Education of the Republic of Korea and the National Research Foundation of Korea (NRF-2018S1A5B8070344).

Author information

Authors and Affiliations

  1. Department of Business Administration, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon, 34134, Korea

    Byung-Cheon Choi

  2. Department of Industrial Management and Engineering, Myongji University, 116 MyongJi-ro, Choein-gu, Yongin-si, Gyeonggi-do, 17058, Korea

    Kyung Min Kim

  3. Graduate School of Logistics, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon, Gyeonggi-do, 22012, Korea

    Yunhong Min

  4. Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do, 17104, Korea

    Myoung-Ju Park

Authors
  1. Byung-Cheon Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyung Min Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunhong Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Myoung-Ju Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Myoung-Ju Park.

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

Choi, BC., Kim, K.M., Min, Y. et al. Scheduling with generalized and periodic due dates under single- and two-machine environments. Optim Lett 16, 623–633 (2022). https://doi.org/10.1007/s11590-021-01739-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-021-01739-8

Keywords

Search

Navigation