{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:17Z","timestamp":1777755497207,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71971165"],"award-info":[{"award-number":["71971165"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202306280147"],"award-info":[{"award-number":["202306280147"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["884\/22"],"award-info":[{"award-number":["884\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12351-025-00951-z","type":"journal-article","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T14:29:17Z","timestamp":1753540157000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling on proportionate flowshop with total late work and job rejection"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4253-3417","authenticated-orcid":false,"given":"Xin-Na","family":"Geng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6518-6411","authenticated-orcid":false,"given":"Xinyu","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jiayin","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"issue":"6","key":"951_CR1","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.omega.2009.12.006","volume":"38","author":"M Alminana","year":"2010","unstructured":"Alminana M, Escudero LF, Landete M, Monge JF, Rabasa A, Sanchez-Soriano J (2010) WISCHE: A DSS for water irrigation scheduling. Omega-Int J Manag Sci 38(6):492\u2013500","journal-title":"Omega-Int J Manag Sci"},{"issue":"18","key":"951_CR2","doi-asserted-by":"crossref","first-page":"2883","DOI":"10.3390\/math12182883","volume":"12","author":"B Bai","year":"2024","unstructured":"Bai B, Wei C-M, He H-Y, Wang J-B (2024) Study on single-machine common\/slack due-window assignment scheduling with delivery times, variable processing times and outsourcing. Mathematics 12(18):2883","journal-title":"Mathematics"},{"issue":"6","key":"951_CR3","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tsi-Tech Et Sci Inform 3(6):415\u2013420","journal-title":"Tsi-Tech Et Sci Inform"},{"issue":"7","key":"951_CR4","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1080\/0305215X.2018.1554066","volume":"51","author":"J Blazewicz","year":"2019","unstructured":"Blazewicz J, Chen X, Lee RCT, Lin BMT, Lin F-C, Pesch E, Sterna M, Wang Z (2019) Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Eng Optim 51(7):1279\u20131280","journal-title":"Eng Optim"},{"issue":"02","key":"951_CR7","doi-asserted-by":"crossref","first-page":"2050046","DOI":"10.1142\/S0217595920500463","volume":"38","author":"RX Chen","year":"2021","unstructured":"Chen RX, Li SS (2021) Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs. Asia-Pacific J Oper Res 38(02):2050046","journal-title":"Asia-Pacific J Oper Res"},{"key":"951_CR9","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.cie.2017.07.016","volume":"111","author":"X Chen","year":"2017","unstructured":"Chen X, Chau V, Xie P, Sterna M, Blazewicz J (2017) Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect. Comput & Indust Eng 111:176\u2013182","journal-title":"Comput & Indust Eng"},{"issue":"7","key":"951_CR10","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1080\/0305215X.2018.1519073","volume":"51","author":"X Chen","year":"2019","unstructured":"Chen X, Wang Z, Pesch E, Sterna M, Blazewicz J (2019) Two-machine flow-shop scheduling to minimize total late work: revisited. Eng Optim 51(7):1268\u20131278","journal-title":"Eng Optim"},{"key":"951_CR6","doi-asserted-by":"crossref","first-page":"107525","DOI":"10.1016\/j.cie.2021.107525","volume":"159","author":"R Chen","year":"2021","unstructured":"Chen R, Yuan J, Ng CT, Cheng TCE (2021) Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput & Indust Eng 159:107525","journal-title":"Comput & Indust Eng"},{"issue":"22","key":"951_CR5","doi-asserted-by":"crossref","first-page":"7630","DOI":"10.1080\/00207543.2022.2160502","volume":"61","author":"R Chen","year":"2023","unstructured":"Chen R, Gao Y, Geng Z, Yuan J (2023) Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. Int J Prod Res 61(22):7630\u20137648","journal-title":"Int J Prod Res"},{"issue":"03","key":"951_CR8","doi-asserted-by":"crossref","first-page":"2350023","DOI":"10.1142\/S0217595923500239","volume":"41","author":"RX Chen","year":"2024","unstructured":"Chen RX, Li SS, Feng Q (2024) Minimizing total weighted late work in a proportionate flow shop with job rejection. Asia Pac J Oper Res 41(03):2350023","journal-title":"Asia Pac J Oper Res"},{"key":"951_CR11","doi-asserted-by":"crossref","first-page":"105329","DOI":"10.1016\/j.cor.2021.105329","volume":"133","author":"D Freud","year":"2021","unstructured":"Freud D, Mosheiov G (2021) Scheduling with competing agents, total late work and job rejection. Comput & Operat Res 133:105329","journal-title":"Comput & Operat Res"},{"key":"951_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.dam.2015.03.011","volume":"189","author":"Y Gao","year":"2015","unstructured":"Gao Y, Yuan J (2015) Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discret Appl Math 189:49\u201352","journal-title":"Discret Appl Math"},{"key":"951_CR13","doi-asserted-by":"crossref","first-page":"109317","DOI":"10.1016\/j.cie.2023.109317","volume":"181","author":"X-N Geng","year":"2023","unstructured":"Geng X-N, Sun X, Wang J, Pan L (2023) Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput & Indust Eng 181:109317","journal-title":"Comput & Indust Eng"},{"issue":"2","key":"951_CR14","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/00207543.2018.1456693","volume":"57","author":"E Gerstl","year":"2018","unstructured":"Gerstl E, Mor B, Mosheiov G (2018) Scheduling on a proportionate flowshop to minimise total late work. Int J Prod Res 57(2):531\u2013543","journal-title":"Int J Prod Res"},{"issue":"11","key":"951_CR15","doi-asserted-by":"crossref","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl E, Mosheiov G (2017) Single machine scheduling problems with generalised due-dates and job-rejection. Int J Prod Res 55(11):3164\u20133172","journal-title":"Int J Prod Res"},{"issue":"1","key":"951_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ejor.2022.10.047","volume":"308","author":"J-E Justkowiak","year":"2023","unstructured":"Justkowiak J-E, Kovalev S, Kovalyov MY, Pesch E (2023) Single machine scheduling with assignable due dates to minimize maximum and total late work. Eur J Oper Res 308(1):76\u201383","journal-title":"Eur J Oper Res"},{"issue":"2","key":"951_CR17","doi-asserted-by":"crossref","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"},{"key":"951_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2015.04.014","volume":"87","author":"C Koulamas","year":"2015","unstructured":"Koulamas C, Panwalkar SS (2015) On the equivalence of single machine earliness\/tardiness problems with job rejection. Comput Indust Eng 87:1\u20133","journal-title":"Comput Indust Eng"},{"issue":"10","key":"951_CR19","doi-asserted-by":"crossref","first-page":"2956","DOI":"10.1080\/00207543.2018.1518603","volume":"57","author":"C Koulamas","year":"2019","unstructured":"Koulamas C, Panwalkar SS (2019) The two-stage no-wait\/blocking proportionate super shop scheduling problem. Int J Prod Res 57(10):2956\u20132965","journal-title":"Int J Prod Res"},{"issue":"4","key":"951_CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s40314-024-02753-z","volume":"43","author":"M-H Li","year":"2024","unstructured":"Li M-H, Lv D-Y, Lv Z-G, Zhang L-H, Wang J-B (2024) A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comput Appl Math 43(4):229","journal-title":"Comput Appl Math"},{"issue":"6","key":"951_CR21","doi-asserted-by":"crossref","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D-Y Lv","year":"2021","unstructured":"Lv D-Y, Wang J-B (2021) Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optimization Lett 15(6):2311\u20132319","journal-title":"Optimization Lett"},{"issue":"6","key":"951_CR22","doi-asserted-by":"crossref","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"},{"key":"951_CR23","doi-asserted-by":"crossref","first-page":"108168","DOI":"10.1016\/j.cie.2022.108168","volume":"169","author":"B Mor","year":"2022","unstructured":"Mor B, Shabtay D (2022) Single-machine scheduling with total late work and job rejection. Comput & Indust Eng 169:108168","journal-title":"Comput & Indust Eng"},{"key":"951_CR24","volume":"181","author":"B Mor","year":"2025","unstructured":"Mor B, Geng XN (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"},{"key":"951_CR25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107138","volume":"154","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Oron D (2021) A note on scheduling a rate modifying activity to minimize total late work. Comput Indust Eng 154:107138","journal-title":"Comput Indust Eng"},{"issue":"3","key":"951_CR26","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Oron D, Shabtay D (2021) Minimizing total late work on a single machine with generalized due-dates. Eur J Oper Res 293(3):837\u2013846","journal-title":"Eur J Oper Res"},{"key":"951_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-0910-7","volume-title":"Planning and Scheduling in Manufacturing and Services","author":"ML Pinedo","year":"2009","unstructured":"Pinedo ML (2009) Planning and Scheduling in Manufacturing and Services. Springer"},{"issue":"5","key":"951_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1992","unstructured":"Potts CN, Vanwassenhove LN (1992) Approximation algorithms for scheduling a single-machine to minimize total late work. Oper Res Lett 11(5):261\u2013266","journal-title":"Oper Res Lett"},{"issue":"3","key":"951_CR29","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts CN, Vanwassenhove LN (1992) Single-machine scheduling to minimize total late work. Oper Res 40(3):586\u2013595","journal-title":"Oper Res"},{"issue":"1\u20133","key":"951_CR30","first-page":"211","volume":"122","author":"XT Qi","year":"2002","unstructured":"Qi XT, Yu G, Bard JF (2002) Single machine scheduling with assignable due dates. Discret Appl Math 122(1\u20133):211\u2013233","journal-title":"Discret Appl Math"},{"issue":"5","key":"951_CR31","doi-asserted-by":"crossref","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 Operat Res Soc 67(5):752\u2013769","journal-title":"J Operat Res Soc"},{"issue":"2","key":"951_CR32","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1007\/s10479-022-04806-0","volume":"322","author":"D Shabtay","year":"2022","unstructured":"Shabtay D (2022) A new perspective on single-machine scheduling problems with late work related criteria. Ann Oper Res 322(2):947\u2013966","journal-title":"Ann Oper Res"},{"issue":"3","key":"951_CR33","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10951-022-00766-2","volume":"27","author":"D Shabtay","year":"2024","unstructured":"Shabtay D, Mor B (2024) Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J Sched 27(3):239\u2013256","journal-title":"J Sched"},{"issue":"3","key":"951_CR34","doi-asserted-by":"crossref","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"},{"issue":"3","key":"951_CR35","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.ejor.2017.08.034","volume":"266","author":"A Shioura","year":"2018","unstructured":"Shioura A, Shakhlevich NV, Strusevich VA (2018) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur J Oper Res 266(3):795\u2013818","journal-title":"Eur J Oper Res"},{"issue":"2","key":"951_CR36","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna M (2011) A survey of scheduling problems with late work criteria. Omega-Int J Manag Sci 39(2):120\u2013129","journal-title":"Omega-Int J Manag Sci"},{"key":"951_CR37","doi-asserted-by":"crossref","first-page":"102453","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna M (2021) Late and early work scheduling: A survey. Omega-Int J Manag Sci 104:102453","journal-title":"Omega-Int J Manag Sci"},{"issue":"6","key":"951_CR38","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1080\/00207543.2018.1510559","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun X, Geng X-N, Wang J-B, Liu F (2019) Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. Int J Prod Res 57(6):1873\u20131891","journal-title":"Int J Prod Res"},{"issue":"1","key":"951_CR39","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X Sun","year":"2020","unstructured":"Sun X, Geng X-N, Liu T (2020) Due-window assignment scheduling in the proportionate flow shop setting. Ann Oper Res 292(1):113\u2013131","journal-title":"Ann Oper Res"},{"issue":"1","key":"951_CR40","doi-asserted-by":"crossref","first-page":"222","DOI":"10.3390\/math11010222","volume":"11","author":"Y-C Wang","year":"2023","unstructured":"Wang Y-C, Wang S-H, Wang J-B (2023) Resource allocation scheduling with position-dependent weights and generalized earliness\u2013tardiness cost. Mathematics 11(1):222","journal-title":"Mathematics"},{"issue":"02","key":"951_CR41","doi-asserted-by":"crossref","first-page":"2450011","DOI":"10.1142\/S0217595924500118","volume":"42","author":"JB Wang","year":"2025","unstructured":"Wang JB, Lv DY, Wan C (2025) Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights. Asia Pac J Oper Res 42(02):2450011","journal-title":"Asia Pac J Oper Res"},{"issue":"3","key":"951_CR42","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s10951-023-00793-7","volume":"27","author":"Q Zhao","year":"2023","unstructured":"Zhao Q, Yuan J (2023) Single-machine primary-secondary scheduling with total tardiness being the primary criterion. J Sched 27(3):309\u2013318","journal-title":"J Sched"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00951-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00951-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00951-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T13:08:06Z","timestamp":1759151286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00951-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,26]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["951"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00951-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,26]]},"assertion":[{"value":"26 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interes"}}],"article-number":"82"}}