Skip to main content
SpringerLink
Log in

Two-machine job shop scheduling with optional job rejection

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

Abstract

We investigate a two-machine job shop scheduling problem with optional job rejection. The target is to look for a feasible schedule for the set of accepted jobs so that the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs is minimized. We propose an exact pseudo-polynomial dynamic programming algorithm, a greedy \(\frac{\sqrt{5}+1}{2}\)-approximation algorithm, an LP-based \(\frac{e}{e-1}\)-approximation algorithm, and a fully polynomial time approximation scheme to solve it. We demonstrate that the proportionate case is \(\mathcal{N}\mathcal{P}\)-hard and provide an \(O(n^2)\)-time algorithm for the agreeable case.

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. Abderrahim, M., Bekrar, A., Trentesaux, D., Aissani, N., Bouamrane, K.: Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints. Optim. Lett. 16, 255–280 (2022)

    Article  MathSciNet  Google Scholar 

  2. Bartal, Y., Leonardi, S., Spaccamela, A.M., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13, 64–78 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Benttaleb, M., Hnaien, F., Yalaoui, F.: Minimising the makespan in the two-machine job shop problem under availability constraints. Int. J. Prod. Res. 57, 1427–1457 (2019)

    Article  Google Scholar 

  4. Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: conventional and new solution techniques. Eur. J. Oper. Res. 93, 1–33 (1996)

    Article  MATH  Google Scholar 

  5. Calis, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. J. Intell. Manuf. 26, 961–973 (2015)

    Article  Google Scholar 

  6. Choi, B.C., Chung, J.: Two-machine flow shop scheduling problem with an outsourcing option. Eur. J. Oper. Res. 213, 66–72 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cesaret, B., Oğuz, C., Salman, F.S.: A Tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39, 1197–1205 (2012)

  8. Gao, Q., Lu, X.: Two-machine flow shop scheduling with individual operation’s rejection. Asia-Pacific J. Oper. Res. 31, 1450002 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  10. Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Math. Program. 94, 361–374 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. He, C., Leung, J.Y.T., Lee, K., Pinedo, M.L.: Improved algorithms for single machine scheduling with release dates and rejections. 4OR 14, 41–55 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jackson, J.R.: An extension of Johnson’s results on job shop scheduling. Naval Res. Logist. Quart. 3, 201–203 (1956)

    Article  Google Scholar 

  13. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113, 390–434 (1999)

    Article  MATH  Google Scholar 

  14. Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on theory of computing (STOC), pp 302–311 (1984)

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

    Article  Google Scholar 

  16. Lee, K., Choi, B.C.: Two-stage production scheduling with an outsourcing option. Eur. J. Oper. Res. 213, 489–497 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lenstra, J.K., Rinnooy Kan, A.H.G.: Computational complexity of discrete optimization problems. Ann. Discr. Math. 4, 121–140 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discr. Math. 1, 343–362 (1977)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Mascis, A., Pacciarelli, D.: Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143, 498–517 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  22. Oğuz, C., Salman, F.S., Yalcin, Z.B. (2010) Order acceptance and scheduling decisions in make-to-order systems. Int. J. Prod. Econ. 125, 200–211

  23. Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241, 653–661 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  24. Ou, J., Zhong, X., Li, C.L.: Faster algorithms for single machine scheduling with release dates and rejection. Inf. Process. Lett. 116, 503–507 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  25. Perez-Rodriguez, R., Jöns, S., Hernandez-Aguirre, A., Alberto-Ochoa, C.: Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm. Int. J. Adv. Manuf. Technol. 73, 3–21 (2014)

  26. Safarzadeh, H., Kianfar, F.: Job shop scheduling with the option of jobs outsourcing. Int. J. Prod. Res. 57, 3255–3272 (2019)

    Article  Google Scholar 

  27. Sana, M.U., Li, Z., Javaid, F., Hanif, M.W., Ashraf, I.: Improved particle swarm optimization based on blockchain mechanism for flexible job shop problem. Clust. Comput. 26, 2519–2537 (2023)

    Article  Google Scholar 

  28. Shabtay, D., Gaspar, N.: Two-machine flow-shop with rejection. Comput. Oper. Res. 39, 1087–1096 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  29. Shabtay, D., Gasper, N., Kaspi, M.: A survey on scheduling problems with rejection. J. Sched. 16, 3–28 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  30. Shabtay, D., Oron, D.: Proportionate flow-shop scheduling with rejection. J. Oper. Res. Soc. 67, 752–769 (2016)

    Article  Google Scholar 

  31. Shmoys, D.B., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM J. Comput. 23, 617–632 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  32. Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212, 1–11 (2011)

    Article  MathSciNet  Google Scholar 

  33. Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast’janov, S.V., Shmoys, D.B.: Short shop schedules. Oper. Res. 45, 288–294 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  34. Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.: Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf. 30, 1809–1830 (2019)

    Article  Google Scholar 

  35. Zhang, L.Q., Lu, L.F.: Parallel-machine scheduling with release dates and rejection. 4OR 14, 165–172 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  36. Zhang, L.Q., Lu, L.F., Yuan, J.J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198, 975–978 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  37. Zhang, L.Q., Lu, L.F., Li, S.S.: New results on two-machine flow-shop scheduling with rejection. J. Comb. Optim. 31, 1493–1504 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  38. Zhong, X., Ou, J.: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR 15, 387–406 (2017)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We would like to thank the two anonymous reviewers for their helpful comments and suggestions on an earlier version of this paper. This research was supported by the Key Research Projects of Henan Higher Education Institutions (24A110014).

Author information

Authors and Affiliations

  1. School of Mathematics and Information Science, Zhongyuan University of Technology, Zhengzhou, 450007, People’s Republic of China

    Ren-Xia Chen & Shi-Sheng Li

Authors
  1. Ren-Xia Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shi-Sheng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ren-Xia Chen.

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

Chen, RX., Li, SS. Two-machine job shop scheduling with optional job rejection. Optim Lett (2023). https://doi.org/10.1007/s11590-023-02077-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11590-023-02077-7

Keywords

Search

Navigation