Skip to main content
SpringerLink
Log in

Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs

  • Original Paper
  • Area 3
  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

In just-in-time production, meeting due dates is one of the most important goals. Motivated by a scenario of just-in-time production, this paper considers the single-machine scheduling problem with release times and common due date assignment. The objective is to determine the optimal due date and schedule simultaneously to minimize a cost function that includes the weighted number of tardy jobs and the due date assignment cost. We show that the problem is NP-hard in the ordinary sense, and propose a dynamic programming algorithm and a fully polynomial-time approximation scheme.

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. Chen, Z.L.: Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. 93, 49–60 (1996)

    Article  MATH  Google Scholar 

  2. Cheng, T.C.E.: Common due date assignment and scheduling for a single processor to minimize the number of tardy jobs. Eng. Optim. 16, 129–136 (1990)

    Article  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and intractablity: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. He, C., Lin, Y.X., Yuan, J.J.: A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. Eur. J. Oper. Res. 201, 966–970 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kianfar, K., Moslehi, G.: A note on fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discret. Appl. Math. 161, 2205–2206 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kim, J.-G., Lee, D.-H.: Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times. J. Oper. Res. Soc. 60, 1264–1272 (2009)

    Article  MATH  Google Scholar 

  8. Kovalyov, M.Y., Kubiak, W.: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J. Heuristics 3, 287–297 (1998)

    Article  MATH  Google Scholar 

  9. Kovalyov, M.Y., Kubiak, W.: A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper. Res. 47, 757–761 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kahlbacher, H.G., Cheng, T.C.E.: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discret. Appl. Math. 47, 139–164 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Panwalker, S.S., Smith, M.L., Seidmann, A.: Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30, 391–399 (1982)

    Article  Google Scholar 

  12. Shabtay, D., Steiner, G.: Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf. Serv. Oper. Manag. 9, 332–350 (2007)

    Google Scholar 

  13. Shabtay, D.: Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput. Oper. Res. 35, 1539–1545 (2008)

    Article  MATH  Google Scholar 

  14. Wu, C.C., Cheng, S.R., Wu, W.H., Yin, Y.Q., Wu, W.H.: The single-machine total tardiness problem with unequal release times and a linear deterioration. Appl. Math. Comput. 219, 10401–10415 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wu, C.C., Hsu, P.H., Lai, K.: Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times. J. Manuf. Sys. 30(1), 54–62 (2011)

    Article  Google Scholar 

  16. Yin, Y.Q., Liu, M., Cheng, T.C.E., Wu, C.C., Cheng, S.R.: Four single-machine scheduling problems involving due date determination decisions. Inf. Sci. 251, 164–181 (2013)

    Article  MathSciNet  Google Scholar 

  17. Yin, Y.Q., Wu, W.H., Cheng, T.C.E., Wu, C.C.: Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities. Int. J. Prod. Res. 52, 2311–2326 (2014)

    Article  Google Scholar 

  18. 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, 5583–5596 (2014)

    Article  Google Scholar 

  19. Yin, Y.Q., Cheng, T.C.E., Yang, X.Q., Wu, C.C.: Two-agent single-machine scheduling with unrestricted due date assignment. Comput. Ind. Eng. 79, 148–155 (2015)

    Article  Google Scholar 

  20. Zhao, C.L., Hsu, C.J., Cheng, S.R., Yin, Y.Q., 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, 503–510 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

We are grateful to the Editor and two anonymous referees for their constructive comments on an earlier version of our paper. This paper was supported by Science and Research Project Foundation of Liaoning Province Education Department (L2014433).

Author information

Authors and Affiliations

  1. School of Mathematics and Systems Science, Shenyang Normal University Shenyang, Liaoning, 110034, People’s Republic of China

    Chuanli Zhao

Authors
  1. Chuanli Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chuanli Zhao.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, C. Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs. Japan J. Indust. Appl. Math. 33, 239–249 (2016). https://doi.org/10.1007/s13160-015-0205-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13160-015-0205-5

Keywords

Mathematics Subject Classification

Search

Navigation