Skip to main content
SpringerLink
Log in

Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection

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

Abstract

We study a single machine due-date assignment problem with a common due-date. The objective function is minimizing the maximum earliness/tardiness cost. The scheduler may process only a subset of the jobs and the remaining jobs are rejected. Job-dependent rejection-costs are considered, and an upper bound on the total permitted rejection cost is assumed. The problem is proved to be NP-Hard. We present and test a pseudo-polynomial dynamic programming solution algorithm. An extension to the setting containing additional due-date cost component is also discussed. An efficient implementation of the algorithm is introduced, and medium size problems (containing hundreds of jobs) are shown to be solved in very reasonable running time. In addition, an intuitive heuristic is introduced, tested numerically, and is shown to produce very small optimality gaps.

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

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Data availability

Not relevant for this paper since the input for our simulation was generated randomly, and the generation process is provided in detail in Sect.  4.

References

  1. Agnetis, A., Mosheiov, G.: Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim. Lett. 11(4), 885–892 (2017)

    Article  MathSciNet  Google Scholar 

  2. Chen, R.X., Li, S.S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4), 1044–1064 (2020)

    Article  MathSciNet  Google Scholar 

  3. Cordone, R., Hosteins, P.: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102, 130–140 (2019)

    Article  MathSciNet  Google Scholar 

  4. Dabiri, M., Darestani, S.A., Naderi, B.: Multi-machine flow shop scheduling problems with rejection using genetic algorithm. Int. J. Serv. Oper. Manag. 32(2), 158–172 (2019)

    Google Scholar 

  5. de Weerdt, M., Baart, R., He, L.: Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur. J. Oper. Res. 291(2), 629–639 (2021)

    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. Geng, X. N., Sun, X., Wang, J., Pan, L.:. Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput. Ind. Eng. 109317 (2023)

  8. Geng, X.N., Wang, J.B., Bai, D.: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51(8), 1301–1323 (2019)

    Article  MathSciNet  Google Scholar 

  9. Gerstl, E., Mosheiov, G.: The single machine CON problem with unavailability period. Int. J. Prod. Res. 59(3), 824–838 (2021)

    Article  Google Scholar 

  10. Gordon, V.S., Proth, J., Chu, C.: 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  Google Scholar 

  11. Hermelin, D., Pinedo, M., Shabtay, D., Talmon, N.: On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1), 67–73 (2019)

    Article  MathSciNet  Google Scholar 

  12. Koulamas, C., Kyparisis, G.J.: The no-wait flow shop with rejection. Int. J. Prod. Res. 59(6), 1852–1859 (2021)

    Article  Google Scholar 

  13. Koulamas, C., Panwalkar, S.S.: On the equivalence of single machine earliness/tardiness problems with job rejection. Comput. Ind. Eng. 87, 1–3 (2015)

    Article  Google Scholar 

  14. Kong, M., Liu, X., Pei, J., Zhou, Z., Pardalos, P.M.: Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim. Lett. 14(4), 857–871 (2020)

    Article  MathSciNet  Google Scholar 

  15. Li, S.S., Chen, R.X.: Scheduling with rejection and a deteriorating maintenance activity on a single machine. Asia-Pac. J. Oper. Res. 34(02), 1750010 (2017)

    Article  MathSciNet  Google Scholar 

  16. Li, S.S., Chen, R.X.: Scheduling with common due date assignment to minimize generalized weighted earliness–tardiness penalties. Optim. Lett. 14(7), 1681–1699 (2020)

    Article  MathSciNet  Google Scholar 

  17. Li, S.S., Chen, R.X., Feng, Q., Jiao, C.W.: Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J. Comb. Optim. 38(3), 957–971 (2019)

    Article  MathSciNet  Google Scholar 

  18. Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR 16(1), 95–104 (2018)

    Article  MathSciNet  Google Scholar 

  19. Liu, W., Jiang, C.: Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52(1), 74–89 (2020)

    Article  MathSciNet  Google Scholar 

  20. Liu, P., Lu, X.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4), 929–952 (2020)

    Article  MathSciNet  Google Scholar 

  21. Liu, W., Yao, Y., Jiang, C.: Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng. Optim. 52(4), 701–714 (2020)

    Article  MathSciNet  Google Scholar 

  22. Lv, D.Y., Wang, J.B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 15(6), 2311–2319 (2021)

    Article  MathSciNet  Google Scholar 

  23. Mor, B., Mosheiov, G.: A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Ann. Oper. Res. 271(2), 1079–1085 (2018)

    Article  MathSciNet  Google Scholar 

  24. Mor, B., Mosheiov, G.: Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper. Res. Int. J. 22(3), 2707–2719 (2022)

    Article  Google Scholar 

  25. Mor, B., Mosheiov, G., & Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Schedul. 1–11 (2019)

  26. Mor, B., Mosheiov, G., Shapira, D.: Single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41(1), 1–11 (2021)

    Article  MathSciNet  Google Scholar 

  27. Mor, B., Shapira, D.: Improved algorithms for scheduling on proportionate flowshop with job-rejection. J. Oper. Res. Soc. 70(11), 1997–2003 (2019)

    Article  Google Scholar 

  28. Mor, B., Shapira, D.: Regular scheduling measures on proportionate flowshop with job rejection. Comput. Appl. Math. 39(2), 1–14 (2020)

    Article  MathSciNet  Google Scholar 

  29. Mor, B., Shapira, D.: Minsum scheduling with acceptable lead-times and optional job rejection. Optim. Lett. 16(3), 1073–1091 (2022)

    Article  MathSciNet  Google Scholar 

  30. Mosheiov, G., Pruwer, S.: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Eng. Optim. 1–17 (2020)

  31. Mosheiov, G., Sarig, A., Strusevich, V.: Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18(4), 439–456 (2020)

    Article  MathSciNet  Google Scholar 

  32. Nasrollahi, V., Moslehi, G., Reisi-Nafchi, M.:. Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem. Oper. Res. 1–40 (2020)

  33. Oron, D.: Two-agent scheduling problems under rejection budget constraints. Omega, 102313 (2020)

  34. Panwalkar, 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 

  35. Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16, 3–28 (2013)

    Article  MathSciNet  Google Scholar 

  36. Thevenin, S., Zufferey, N.: Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discrete Appl. Math. 261, 344–353 (2019)

    Article  MathSciNet  Google Scholar 

  37. Thevenin, S., Zufferey, N., Widmer, M.: Order acceptance and scheduling with earliness and tardiness penalties. J. Heurist. 22, 849–890 (2016)

    Article  Google Scholar 

  38. Wang, J.B., Xu, J.X., Guo, F., Liu, M.: Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times. Eng. Optim. 54(3), 471–486 (2022)

    Article  MathSciNet  Google Scholar 

  39. Wang, D., Yin, Y., Cheng, T.C.E.: Parallel-machine rescheduling with job unavailability and rejection. Omega 81, 246–260 (2018)

    Article  Google Scholar 

  40. Zhang, L., Lu, L., Yuan, J.: Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411, 1877–1882 (2010)

    Article  MathSciNet  Google Scholar 

  41. Zhang, X., Xu, D., Du, D., Wu, C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35(1), 318–330 (2018)

    Article  MathSciNet  Google Scholar 

  42. Zou, J., Yuan, J.: Single-machine scheduling with maintenance activities and rejection. Discret. Optim. 38, 100609 (2020)

    Article  MathSciNet  Google Scholar 

  43. Zuo, L., Sun, Z., Lu, L., Zhang, L.: Single-machine scheduling with rejection and an operator non-availability interval. Mathematics 7(8), 668 (2019)

    Article  Google Scholar 

Download references

Acknowledgements

The second author was supported by the Israel Science Foundation (Grant No.2505/19) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135.

Author information

Authors and Affiliations

  1. School of Business Administration, The Hebrew University, 91905, Jerusalem, Israel

    Matan Atsmony & Gur Mosheiov

Authors
  1. Matan Atsmony
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gur Mosheiov
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Atsmony, M., Mosheiov, G. Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. Optim Lett 18, 751–766 (2024). https://doi.org/10.1007/s11590-023-02086-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02086-6

Keywords

Search

Navigation