{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:16:52Z","timestamp":1778692612145,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:00:00Z","timestamp":1778630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:00:00Z","timestamp":1778630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s40314-026-03782-6","type":"journal-article","created":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:42:03Z","timestamp":1778690523000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing range of job completion times with general position-dependent processing times and job-rejection"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,13]]},"reference":[{"issue":"3","key":"3782_CR1","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s11590-023-02086-6","volume":"18","author":"M Atsmony","year":"2024","unstructured":"Atsmony M, Mosheiov G (2024) Single machine scheduling to minimize maximum earliness\/tardiness cost with job rejection. Optim Lett 18(3):751\u2013766","journal-title":"Optim Lett"},{"issue":"1","key":"3782_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1287\/opre.37.1.118","volume":"37","author":"U Bagchi","year":"1989","unstructured":"Bagchi U (1989) Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Oper Res 37(1):118\u2013125","journal-title":"Oper Res"},{"issue":"3","key":"3782_CR40","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0305-0548(02)00225-3","volume":"31","author":"M Birman","year":"2004","unstructured":"Birman M,  Mosheiov G (2004) A note on a due-date assignment on a two-machine flow-shop. Comput Oper Res 31(3):473\u2013480","journal-title":"Comput Oper Res"},{"issue":"7","key":"3782_CR3","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1007\/s11590-023-02077-7","volume":"18","author":"RX Chen","year":"2024","unstructured":"Chen RX, Li SS (2024) Two-machine job shop scheduling with optional job rejection. Optim Lett 18(7):1593\u20131618","journal-title":"Optim Lett"},{"key":"3782_CR4","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2024.2382150","author":"E Cohen","year":"2024","unstructured":"Cohen E, Shapira D (2024) Minimising the makespan on parallel identical machines with log-linear position-dependent processing times. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2024.2382150","journal-title":"J Oper Res Soc"},{"issue":"6","key":"3782_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","volume":"23","author":"S Eilon","year":"1977","unstructured":"Eilon S, Chowdhury IG (1977) Minimising waiting time variance in the single machine problem. Manag Sci 23(6):567\u2013575","journal-title":"Manag Sci"},{"issue":"2","key":"3782_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/01605682.2023.2197000","volume":"75","author":"K Fang","year":"2024","unstructured":"Fang K, Luo W, Pinedo ML, Jin M, Lu L (2024) Rescheduling for new orders on a single machine with rejection. J Oper Res Soc 75(2):346\u2013360","journal-title":"J Oper Res Soc"},{"issue":"7","key":"3782_CR7","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1002\/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1","volume":"40","author":"A Federgruen","year":"1993","unstructured":"Federgruen A, Mosheiov G (1993) Simultaneous optimization of efficiency and performance balance measures in single\u2010machine scheduling problems. Nav Res Logist 40(7):951\u2013970","journal-title":"Nav Res Logist"},{"issue":"4","key":"3782_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s11590-024-02138-5","volume":"19","author":"E Gerstl","year":"2025","unstructured":"Gerstl E, Mosheiov G (2025) Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. Optim Lett 19(4):833\u2013845","journal-title":"Optim Lett"},{"key":"3782_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2025.111695","volume":"212","author":"Y Guo","year":"2026","unstructured":"Guo Y, Luo W, Xu D (2026) Single two-stage openshop and parallel two-stage openshops scheduling with optional job rejection under makespan constraint. Comput Ind Eng 212:111695","journal-title":"Comput Ind Eng"},{"issue":"7","key":"3782_CR10","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1007\/s11590-023-02073-x","volume":"18","author":"B Hou","year":"2024","unstructured":"Hou B, Zheng H, Liu W, Wu W, Du DZ, Gao S (2024) Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. Optim Lett 18(7):1747\u20131754","journal-title":"Optim Lett"},{"key":"3782_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-024-01411-2","author":"C Hu","year":"2024","unstructured":"Hu C, Zheng R, Lu S, Liu X (2024) Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities. J Glob Optim. https:\/\/doi.org\/10.1007\/s10898-024-01411-2","journal-title":"J Glob Optim"},{"issue":"12","key":"3782_CR12","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","volume":"27","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981a) Minimizing variation of flow time in single machine systems. Manag Sci 27(12):1453\u20131459","journal-title":"Manag Sci"},{"issue":"4","key":"3782_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981b) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist Q 28(4):643\u2013651","journal-title":"Nav Res Logist Q"},{"issue":"20","key":"3782_CR14","doi-asserted-by":"publisher","first-page":"5698","DOI":"10.1080\/00207543.2011.613872","volume":"50","author":"J Krishnaraj","year":"2012","unstructured":"Krishnaraj J, Pugazhendhi S, Rajendran C, Thiagarajan S (2012) A modified ant-colony optimisation algorithm to minimise the completion time variance of jobs in flowshops. Int J Prod Res 50(20):5698\u20135706","journal-title":"Int J Prod Res"},{"issue":"3","key":"3782_CR15","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2023.11.002","volume":"314","author":"W Li","year":"2024","unstructured":"Li W, Ou J (2024) Machine scheduling with restricted rejection: an application to task offloading in cloud\u2013edge collaborative computing. Eur J Oper Res 314(3):912\u2013919","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3782_CR16","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1007\/s12190-024-02080-w","volume":"70","author":"MH Li","year":"2024","unstructured":"Li MH, Lv DY, Zhang LH, Wang JB (2024a) Permutation flow shop scheduling with makespan objective and truncated learning effects. J Appl Math Comput 70(4):2907\u20132939","journal-title":"J Appl Math Comput"},{"issue":"4","key":"3782_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s40314-024-02753-z","volume":"43","author":"MH Li","year":"2024","unstructured":"Li MH, Lv DY, Lv ZG, Zhang LH, Wang JB (2024b) 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":"3","key":"3782_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10878-025-01271-w","volume":"49","author":"N Li","year":"2025","unstructured":"Li N, Ma R, Zhang Y (2025) Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components. J Comb Optim 49(3):37","journal-title":"J Comb Optim"},{"issue":"1","key":"3782_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.3934\/jimo.2023079","volume":"20","author":"W Liu","year":"2024","unstructured":"Liu W, Wang X, Li L, Dai W (2024) Due-window assignment scheduling with job-rejection, truncated learning effects and setup times. J Ind Manag Optim 20(1):313\u2013324","journal-title":"J Ind Manag Optim"},{"key":"3782_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110599","volume":"197","author":"DY Lv","year":"2024","unstructured":"Lv DY, Wang JB (2024a) Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling. Comput Ind Eng 197:110599","journal-title":"Comput Ind Eng"},{"issue":"06","key":"3782_CR21","doi-asserted-by":"publisher","first-page":"2450003","DOI":"10.1142\/S0217595924500039","volume":"41","author":"DY Lv","year":"2024","unstructured":"Lv DY, Wang JB (2024b) No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia Pac J Oper Res 41(06):2450003","journal-title":"Asia Pac J Oper Res"},{"issue":"7","key":"3782_CR22","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1080\/0305215X.2024.2372633","volume":"57","author":"DY Lv","year":"2025","unstructured":"Lv DY, Wang JB (2025) Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng Optim 57(7):1828\u20131848","journal-title":"Eng Optim"},{"issue":"9","key":"3782_CR23","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","volume":"18","author":"AG Merten","year":"1972","unstructured":"Merten AG, Muller ME (1972) Variance minimization in single machine sequencing problems. Manag Sci 18(9):518\u2013528","journal-title":"Manag Sci"},{"key":"3782_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107046","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":"3782_CR25","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2024.2314714","author":"B Mor","year":"2024","unstructured":"Mor B, Mosheiov G (2024) Scheduling on parallel dedicated machines with job rejection. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2024.2314714","journal-title":"Int J Prod Res"},{"issue":"4","key":"3782_CR26","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-025-00848-x","volume":"28","author":"B Mor","year":"2025","unstructured":"Mor B, Mosheiov G, Shabtay D (2025) Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities. J Sched 28(4):377\u2013390","journal-title":"J Sched"},{"issue":"5","key":"3782_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-025-03586-0","volume":"45","author":"B Mor","year":"2026","unstructured":"Mor B, Shapira D, Sonn N (2026) Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines. Comput Appl Math 45(5):217","journal-title":"Comput Appl Math"},{"issue":"8","key":"3782_CR28","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1002\/1520-6750(200012)47:8<657::AID-NAV4>3.0.CO;2-1","volume":"47","author":"G Mosheiov","year":"2000","unstructured":"Mosheiov G (2000) Minimizing mean absolute deviation of job completion times from the mean completion time. Nav Res Logist (NRL) 47(8):657\u2013668","journal-title":"Nav Res Logist (NRL)"},{"issue":"6","key":"3782_CR29","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","journal-title":"Int J Prod Res"},{"issue":"2","key":"3782_CR30","first-page":"47","volume":"25","author":"G Mosheiov","year":"2025","unstructured":"Mosheiov G, Sarig A (2025) A note: approximation algorithms for batch scheduling on shops with job rejection: G. Mosheiov, A. Sarig. Oper Res 25(2):47","journal-title":"Oper Res"},{"issue":"5","key":"3782_CR31","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","volume":"21","author":"L Schrage","year":"1975","unstructured":"Schrage L (1975) Minimizing the time-in-system variance for a finite jobset. Manag Sci 21(5):540\u2013543","journal-title":"Manag Sci"},{"issue":"3","key":"3782_CR32","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ejor.2024.03.021","volume":"316","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 316(3):887\u2013898","journal-title":"Eur J Oper Res"},{"key":"3782_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"issue":"1","key":"3782_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-025-02694-8","volume":"72","author":"ZW Sun","year":"2026","unstructured":"Sun ZW, Lv DY, Ji P, Wang JB (2026) Minimizing total completion time scheduling problem with ready times and linear deterioration functions of processing times. J Appl Math Comput 72(1):42","journal-title":"J Appl Math Comput"},{"issue":"3","key":"3782_CR35","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/0305215X.2021.1876041","volume":"54","author":"JB Wang","year":"2022","unstructured":"Wang JB, Xu JX, Guo F, Liu M (2022) Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times. Eng Optim 54(3):471\u2013486","journal-title":"Eng Optim"},{"issue":"4","key":"3782_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-024-02717-3","volume":"43","author":"XY Wang","year":"2024","unstructured":"Wang XY, Lv DY, Ji P, Yin N, Wang JB, Qian J (2024) Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times. Comput Appl Math 43(4):194","journal-title":"Comput Appl Math"},{"issue":"6","key":"3782_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-024-02881-6","volume":"43","author":"N Yin","year":"2024","unstructured":"Yin N, Gao M (2024) Single-machine group scheduling with general linear deterioration and truncated learning effects. Comput Appl Math 43(6):386","journal-title":"Comput Appl Math"},{"key":"3782_CR38","doi-asserted-by":"publisher","DOI":"10.1002\/nav.70009","author":"Y Yin","year":"2025","unstructured":"Yin Y, Jia K, Cheng TCE, Li X (2025) An exact approach for multitask\u2010oriented service composition and scheduling in cloud manufacturing with unavailable time windows and subtask rejection. Nav Res Logist (NRL). https:\/\/doi.org\/10.1002\/nav.70009","journal-title":"Nav Res Logist (NRL)"},{"issue":"05","key":"3782_CR39","doi-asserted-by":"publisher","first-page":"2550009","DOI":"10.1142\/S0217595925500095","volume":"42","author":"L Zhang","year":"2025","unstructured":"Zhang L, Lu L, Sun X,  Zuo L (2025) Online single machine scheduling of unit time jobs with rejection: minimizing the maximum quadratic completion time. Asia-Pac J Oper Res 42(05):2550009","journal-title":"Asia-Pac J Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03782-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:42:04Z","timestamp":1778690524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03782-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,13]]},"references-count":40,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["3782"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03782-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,13]]},"assertion":[{"value":"21 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 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":"The authors have no relevant financial or non-financial interests to disclose. The authors have no competing interests to declare that are relevant to the content of this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"399"}}