{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:52:25Z","timestamp":1781653945110,"version":"3.54.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100013043","name":"Ariel University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100013043","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Scheduling in proportionate flow shop environments is a fundamental challenge in manufacturing and service systems, where Just-in-Time performance plays a critical role in reducing inventory and improving responsiveness. This study is motivated by practical constraints such as limited storage capacity between machines and outsourcing costs, which require selective job acceptance and rejection. We first examine the setting with unlimited intermediate storage and then address the more restrictive no-wait environment. In both cases, the objective is to maximize the weighted number of Just-in-Time jobs subject to an upper bound on the total rejection cost. Since these problems are NP-hard even in the single-machine case, we develop pseudo-polynomial dynamic programming algorithms that yield exact solutions. Our proposed methods provide a tractable approach for medium-sized instances. A comprehensive computational study demonstrates that the algorithms consistently deliver high-quality solutions within reasonable computation times. These findings confirm the effectiveness of dynamic programming for Just-in-Time scheduling with job rejection in proportionate flow shops, offering valuable insights for future research on scalable optimization techniques.<\/jats:p>","DOI":"10.1007\/s12351-026-01044-1","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:26:16Z","timestamp":1777713976000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing the weighted number of Just-In-Time jobs in a proportionate flow shop with job rejection"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,2]]},"reference":[{"issue":"2","key":"1044_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10951-022-00745-7","volume":"26","author":"A Atsmony","year":"2023","unstructured":"Atsmony A, Mosheiov G (2023) Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. J Sched 26(2):193\u2013207","journal-title":"J Sched"},{"key":"1044_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-023-02077-7","author":"R-X Chen","year":"2023","unstructured":"Chen R-X, Li S-S (2023) Two-machine job shop scheduling with optional job rejection. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-023-02077-7","journal-title":"Optim Lett"},{"key":"1044_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500239","author":"R Chen","year":"2023","unstructured":"Chen R, Li SS, Feng Q (2023) Minimizing total weighted late work in a proportionate flow shop with job rejection. Asia-Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595923500239","journal-title":"Asia-Pac J Oper Res"},{"issue":"3","key":"1044_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s12351-025-00951-z","volume":"25","author":"X-N Geng","year":"2025","unstructured":"Geng X-N, Sun X, Wang J, Mor B (2025) Scheduling on proportionate flowshop with total late work and job rejection. Oper Res Int J 25(3):82","journal-title":"Oper Res Int J"},{"issue":"2","key":"1044_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2014.09.004","volume":"115","author":"E Gerstl","year":"2015","unstructured":"Gerstl E, Mor B, Mosheiov G (2015) A note: maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf Process Lett 115(2):159\u2013162","journal-title":"Inf Process Lett"},{"key":"1044_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham R, Lawler E, Lenstra J, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"1044_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2020.01.002","volume":"284","author":"C Koulamas","year":"2020","unstructured":"Koulamas C (2020) The proportionate flow shop total tardiness problem. Eur J Oper Res 284(2):439\u2013444","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1044_CR8","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1080\/00207543.2020.1727042","volume":"59","author":"C Koulamas","year":"2021","unstructured":"Koulamas C, Kyparisis GJ (2021) The no-wait flow shop with rejection. Int J Prod Res 59(6):1852\u20131859","journal-title":"Int J Prod Res"},{"issue":"11","key":"1044_CR9","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/01605682.2022.2139645","volume":"74","author":"C Koulamas","year":"2023","unstructured":"Koulamas C, Kyparisis GJ (2023) Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop. J Oper Res Soc 74(11):2289\u20132299","journal-title":"J Oper Res Soc"},{"issue":"8","key":"1044_CR10","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann A, Mosheiov G (1996a) Single machine scheduling to minimize the number of early and tardy jobs. Comput Oper Res 23(8):769\u2013781","journal-title":"Comput Oper Res"},{"issue":"8","key":"1044_CR11","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann A, Mosheiov G (1996b) Single machine scheduling to minimize the number of early and tardy jobs. Comput Oper Res 23(8):769\u2013781","journal-title":"Comput Oper Res"},{"issue":"04","key":"1044_CR12","doi-asserted-by":"publisher","first-page":"1750015","DOI":"10.1142\/S0217595917500154","volume":"34","author":"S Li","year":"2017","unstructured":"Li S, Qian D, Chen R (2017) Proportionate flow shop scheduling with rejection. Asia-Pac J Oper Res 34(04):1750015","journal-title":"Asia-Pac J Oper Res"},{"issue":"6","key":"1044_CR13","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D Lv","year":"2021","unstructured":"Lv D, Wang J (2021) Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim Lett 15(6):2311\u20132319","journal-title":"Optim Lett"},{"key":"1044_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-023-00754-0","author":"B Mor","year":"2023","unstructured":"Mor B (2023) Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Oper Res Int Journal. https:\/\/doi.org\/10.1007\/s12351-023-00754-0","journal-title":"Oper Res Int Journal"},{"key":"1044_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107046","volume":"181","author":"B Mor","year":"2025","unstructured":"Mor B, Geng X-N (2025) Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates. Comput Oper Res 181:107046","journal-title":"Comput Oper Res"},{"issue":"9","key":"1044_CR16","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1057\/jors.2014.112","volume":"66","author":"B Mor","year":"2015","unstructured":"Mor B, Mosheiov G (2015a) Minimizing the number of early jobs on a proportionate flowshop. J Oper Res Soc 66(9):1426\u20131429","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1044_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2014.09.023","volume":"115","author":"B Mor","year":"2015","unstructured":"Mor B, Mosheiov G (2015b) A note: minimizing maximum earliness on a proportionate flowshop. Inf Process Lett 115(2):253\u2013255","journal-title":"Inf Process Lett"},{"issue":"2","key":"1044_CR18","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016) Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur J Oper Res 254(2):360\u2013370","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1044_CR19","doi-asserted-by":"publisher","first-page":"2707","DOI":"10.1007\/s12351-021-00627-4","volume":"22","author":"B Mor","year":"2022","unstructured":"Mor B, Mosheiov G (2022) Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper Res Int J 22(3):2707\u20132719","journal-title":"Oper Res Int J"},{"key":"1044_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106617","author":"B Mor","year":"2024","unstructured":"Mor B, Mosheiov G (2024) Due-date assignment with acceptable lead-times on parallel machines. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2024.106617","journal-title":"Comput Oper Res"},{"issue":"11","key":"1044_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 (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11):1997\u20132003","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1044_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020) Regular scheduling measures on proportionate flowshop with job rejection. Comput Appl Math 39(2):107","journal-title":"Comput Appl Math"},{"issue":"6","key":"1044_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10951-021-00697-4","volume":"24","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shabtay D (2021) Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J Sched 24(6):553\u2013567","journal-title":"J Sched"},{"issue":"6","key":"1044_CR24","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1080\/00207543.2023.2217277","volume":"62","author":"G Mosheiov","year":"2024","unstructured":"Mosheiov G, Sarig A (2024) A common due-date assignment problem with job rejection on parallel uniform machines. Int J Prod Res 62(6):2083\u20132092. https:\/\/doi.org\/10.1080\/00207543.2023.2217277","journal-title":"Int J Prod Res"},{"key":"1044_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121947","author":"T Mraihi","year":"2024","unstructured":"Mraihi T, Driss O, El-Haouzi H (2024) Distributed permutation flow shop scheduling problem with worker flexibility: review, trends and model proposition. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2023.121947","journal-title":"Expert Syst Appl"},{"issue":"9","key":"1044_CR26","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1080\/01605682.2018.1495996","volume":"70","author":"D Oron","year":"2019","unstructured":"Oron D (2019) Batching and resource allocation decisions on an m-machine proportionate flowshop. J Oper Res Soc 70(9):1571\u20131578","journal-title":"J Oper Res Soc"},{"key":"1044_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cie.2017.03.013","volume":"107","author":"SS Panwalkar","year":"2017","unstructured":"Panwalkar SS, Koulamas C (2017) On the dominance of permutation schedules for some ordered and proportionate flow shop problems. Comput Ind Eng 107:105\u2013108","journal-title":"Comput Ind Eng"},{"issue":"9","key":"1044_CR28","doi-asserted-by":"publisher","first-page":"2789","DOI":"10.1080\/00207543.2020.1740345","volume":"59","author":"S Panwalkar","year":"2021","unstructured":"Panwalkar S, Koulamas C (2021) New results for minimising variation of flow time in two-machine proportionate no-wait flow shops. Int J Prod Res 59(9):2789\u20132799","journal-title":"Int J Prod Res"},{"issue":"1","key":"1044_CR29","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"S Panwalkar","year":"2013","unstructured":"Panwalkar S, Smith M, Koulamas C (2013) Review of the ordered and proportionate flow shop scheduling research. Nav Res Logist 60(1):46\u201355","journal-title":"Nav Res Logist"},{"issue":"1","key":"1044_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-021-04414-4","volume":"309","author":"J Qian","year":"2022","unstructured":"Qian J, Han H (2022) Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann Oper Res 309(1):249\u2013258","journal-title":"Ann Oper Res"},{"issue":"3","key":"1044_CR31","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2011.07.053","volume":"216","author":"D Shabtay","year":"2012","unstructured":"Shabtay D (2012) The just-in-time scheduling problem in a flow-shop scheduling system. Eur J Oper Res 216(3):521\u2013532","journal-title":"Eur J Oper Res"},{"key":"1044_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2024.03.021","author":"D Shabtay","year":"2024","unstructured":"Shabtay D, Gerstl E (2024) Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2024.03.021","journal-title":"Eur J Oper Res"},{"key":"1044_CR33","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 (2016) Proportionate flow-shop scheduling with rejection. J Oper Res Soc 67:752\u2013769","journal-title":"J Oper Res Soc"},{"issue":"3","key":"1044_CR34","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich N, Hoogeveen H, Pinedo M (1998) Minimizing total weighted completion time in a proportionate flow shop. J Sched 1(3):157\u2013168","journal-title":"J Sched"},{"key":"1044_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X Sun","year":"2020","unstructured":"Sun X, Geng X, Liu T (2020a) Due-window assignment scheduling in the proportionate flow shop setting. Ann Oper Res 292:113\u2013131","journal-title":"Ann Oper Res"},{"key":"1044_CR36","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X Sun","year":"2020","unstructured":"Sun X, Geng X, Liu T (2020b) Due-window assignment scheduling in the proportionate flow shop setting. Ann Oper Res 292:113\u2013131","journal-title":"Ann Oper Res"},{"issue":"4","key":"1044_CR37","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1093\/comjnl\/bxab201","volume":"66","author":"M Toksari","year":"2023","unstructured":"Toksari M, Atalay B (2023) Some scheduling problems with job rejection and a learning effect. Comput J 66(4):866\u2013872","journal-title":"Comput J"},{"issue":"16\u201318","key":"1044_CR38","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang L, Lu L, Yuan J (2010) Single-machine scheduling under the job rejection constraint. Theor Comput Sci 411(16\u201318):1877\u20131882","journal-title":"Theor Comput Sci"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01044-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01044-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01044-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T22:58:53Z","timestamp":1781650733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01044-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,2]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["1044"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01044-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,2]]},"assertion":[{"value":"26 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"59"}}