{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:56:08Z","timestamp":1783572968402,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Research Projects of Henan Higher Education Institutions","award":["20A110037"],"award-info":[{"award-number":["20A110037"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11590-023-02077-7","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T09:02:33Z","timestamp":1701853353000},"page":"1593-1618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Two-machine job shop scheduling with optional job rejection"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6131-1369","authenticated-orcid":false,"given":"Ren-Xia","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi-Sheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,6]]},"reference":[{"key":"2077_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s11590-020-01674-0","volume":"16","author":"M Abderrahim","year":"2022","unstructured":"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\u2013280 (2022)","journal-title":"Optim. Lett."},{"key":"2077_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Spaccamela, A.M., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"2077_CR3","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1080\/00207543.2018.1489160","volume":"57","author":"M Benttaleb","year":"2019","unstructured":"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\u20131457 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"2077_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: conventional and new solution techniques. Eur. J. Oper. Res. 93, 1\u201333 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR5","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","volume":"26","author":"B Calis","year":"2015","unstructured":"Calis, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. J. Intell. Manuf. 26, 961\u2013973 (2015)","journal-title":"J. Intell. Manuf."},{"key":"2077_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2011.03.017","volume":"213","author":"BC Choi","year":"2011","unstructured":"Choi, B.C., Chung, J.: Two-machine flow shop scheduling problem with an outsourcing option. Eur. J. Oper. Res. 213, 66\u201372 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR7","doi-asserted-by":"crossref","unstructured":"Cesaret, B., O\u011fuz, C., Salman, F.S.: A Tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39, 1197\u20131205 (2012)","DOI":"10.1016\/j.cor.2010.09.018"},{"key":"2077_CR8","doi-asserted-by":"publisher","first-page":"1450002","DOI":"10.1142\/S021759591450002X","volume":"31","author":"Q Gao","year":"2014","unstructured":"Gao, Q., Lu, X.: Two-machine flow shop scheduling with individual operation\u2019s rejection. Asia-Pacific J. Oper. Res. 31, 1450002 (2014)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"2077_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of $$\\cal{NP}$$-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $$\\cal{NP}$$-Completeness. Freeman, San Francisco (1979)"},{"key":"2077_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Math. Program. 94, 361\u2013374 (2003)","journal-title":"Math. Program."},{"key":"2077_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","volume":"14","author":"C He","year":"2016","unstructured":"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\u201355 (2016)","journal-title":"4OR"},{"key":"2077_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"JR Jackson","year":"1956","unstructured":"Jackson, J.R.: An extension of Johnson\u2019s results on job shop scheduling. Naval Res. Logist. Quart. 3, 201\u2013203 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"2077_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"AS Jain","year":"1999","unstructured":"Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113, 390\u2013434 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"key":"2077_CR15","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1080\/00207543.2020.1727042","volume":"59","author":"C Koulamas","year":"2021","unstructured":"Koulamas, C., Kyparisis, G.J.: The no-wait flow shop with rejection. Int. J. Prod. Res. 59, 1852\u20131859 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"2077_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ejor.2011.03.037","volume":"213","author":"K Lee","year":"2011","unstructured":"Lee, K., Choi, B.C.: Two-stage production scheduling with an outsourcing option. Eur. J. Oper. Res. 213, 489\u2013497 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"JK Lenstra","year":"1979","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Computational complexity of discrete optimization problems. Ann. Discr. Math. 4, 121\u2013140 (1979)","journal-title":"Ann. Discr. Math."},{"key":"2077_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discr. Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discr. Math."},{"key":"2077_CR19","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"P Liu","year":"2020","unstructured":"Liu, P., Lu, X.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40, 929\u2013952 (2020)","journal-title":"J. Comb. Optim."},{"key":"2077_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., Pacciarelli, D.: Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143, 498\u2013517 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR21","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor, B., Shapira, D.: Improved algorithms for scheduling on proportionate flowshop with job-rejection. J. Oper. Res. Soc. 70, 1997\u20132003 (2019)","journal-title":"J. Oper. Res. Soc."},{"key":"2077_CR22","doi-asserted-by":"crossref","unstructured":"O\u011fuz, C., Salman, F.S., Yalcin, Z.B. (2010) Order acceptance and scheduling decisions in make-to-order systems. Int. J. Prod. Econ. 125, 200\u2013211","DOI":"10.1016\/j.ijpe.2010.02.002"},{"key":"2077_CR23","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241, 653\u2013661 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou, J., Zhong, X., Li, C.L.: Faster algorithms for single machine scheduling with release dates and rejection. Inf. Process. Lett. 116, 503\u2013507 (2016)","journal-title":"Inf. Process. Lett."},{"key":"2077_CR25","doi-asserted-by":"crossref","unstructured":"Perez-Rodriguez, R., J\u00f6ns, 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\u201321 (2014)","DOI":"10.1007\/s00170-014-5759-x"},{"key":"2077_CR26","doi-asserted-by":"publisher","first-page":"3255","DOI":"10.1080\/00207543.2019.1579934","volume":"57","author":"H Safarzadeh","year":"2019","unstructured":"Safarzadeh, H., Kianfar, F.: Job shop scheduling with the option of jobs outsourcing. Int. J. Prod. Res. 57, 3255\u20133272 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"2077_CR27","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1007\/s10586-021-03349-6","volume":"26","author":"MU Sana","year":"2023","unstructured":"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\u20132537 (2023)","journal-title":"Clust. Comput."},{"key":"2077_CR28","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1016\/j.cor.2011.05.023","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Gaspar, N.: Two-machine flow-shop with rejection. Comput. Oper. Res. 39, 1087\u20131096 (2012)","journal-title":"Comput. Oper. Res."},{"key":"2077_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gasper, N., Kaspi, M.: A survey on scheduling problems with rejection. J. Sched. 16, 3\u201328 (2013)","journal-title":"J. Sched."},{"key":"2077_CR30","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1057\/jors.2015.95","volume":"67","author":"D Shabtay","year":"2016","unstructured":"Shabtay, D., Oron, D.: Proportionate flow-shop scheduling with rejection. J. Oper. Res. Soc. 67, 752\u2013769 (2016)","journal-title":"J. Oper. Res. Soc."},{"key":"2077_CR31","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"DB Shmoys","year":"1994","unstructured":"Shmoys, D.B., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM J. Comput. 23, 617\u2013632 (1994)","journal-title":"SIAM J. Comput."},{"key":"2077_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212, 1\u201311 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR33","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"DP Williamson","year":"1997","unstructured":"Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast\u2019janov, S.V., Shmoys, D.B.: Short shop schedules. Oper. Res. 45, 288\u2013294 (1997)","journal-title":"Oper. Res."},{"key":"2077_CR34","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2019","unstructured":"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\u20131830 (2019)","journal-title":"J. Intell. Manuf."},{"key":"2077_CR35","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"LQ Zhang","year":"2016","unstructured":"Zhang, L.Q., Lu, L.F.: Parallel-machine scheduling with release dates and rejection. 4OR 14, 165\u2013172 (2016)","journal-title":"4OR"},{"key":"2077_CR36","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang, L.Q., Lu, L.F., Yuan, J.J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198, 975\u2013978 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"2077_CR37","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/s10878-015-9836-3","volume":"31","author":"LQ Zhang","year":"2016","unstructured":"Zhang, L.Q., Lu, L.F., Li, S.S.: New results on two-machine flow-shop scheduling with rejection. J. Comb. Optim. 31, 1493\u20131504 (2016)","journal-title":"J. Comb. Optim."},{"key":"2077_CR38","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10288-016-0339-6","volume":"15","author":"X Zhong","year":"2017","unstructured":"Zhong, X., Ou, J.: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR 15, 387\u2013406 (2017)","journal-title":"4OR"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02077-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02077-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02077-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T04:18:36Z","timestamp":1724905116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02077-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,6]]},"references-count":38,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2077"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02077-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,6]]},"assertion":[{"value":"31 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}