{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:41:07Z","timestamp":1787319667331,"version":"build-2736575974"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s12351-024-00887-w","type":"journal-article","created":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T06:10:56Z","timestamp":1734243056000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling with step learning and job rejection"],"prefix":"10.1007","volume":"25","author":[{"given":"Jiaxin","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2448-2158","authenticated-orcid":false,"given":"Cuixia","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fanyu","family":"Kong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,15]]},"reference":[{"key":"887_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00763-5","author":"M Atsmony","year":"2022","unstructured":"Atsmony M, Mor B, Mosheiov G (2022) Single machine scheduling with step-learning. J Sched. https:\/\/doi.org\/10.1007\/s10951-022-00763-5","journal-title":"J Sched"},{"issue":"1","key":"887_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115(1):173\u2013178","journal-title":"Eur J Oper Res"},{"issue":"1","key":"887_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13(1):64\u201378","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"887_CR4","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"ZG Cao","year":"2007","unstructured":"Cao ZG, Zhang YZ (2007) Scheduling with rejection and non-identical job arrivals. J Syst Sci Complex 20(4):529\u2013535","journal-title":"J Syst Sci Complex"},{"key":"887_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/00140135708964571","volume":"1","author":"JR DeJong","year":"1957","unstructured":"DeJong JR (1957) The effects of increasing skill on cycle time and its consequences for time standards. Ergonomics 1:51\u201360","journal-title":"Ergonomics"},{"key":"887_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"887_CR7","doi-asserted-by":"publisher","DOI":"10.3390\/math11194135","author":"HY He","year":"2023","unstructured":"He HY, Zhao YZ, Ma XJ, Lu YY, Ren N, Wang JB (2023) Study on scheduling problems with learning effects and past sequence delivery times. Mathematics. https:\/\/doi.org\/10.3390\/math11194135","journal-title":"Mathematics"},{"key":"887_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1009626427432","volume":"3","author":"MY Kovalyov","year":"1998","unstructured":"Kovalyov MY, Kubiak W (1998) A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J Heuristics 3:287\u2013297","journal-title":"J Heuristics"},{"key":"887_CR9","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1287\/opre.47.5.757","volume":"47","author":"MY Kovalyov","year":"1999","unstructured":"Kovalyov MY, Kubiak W (1999) A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper Res 47:757\u2013761","journal-title":"Oper Res"},{"key":"887_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00481-5","author":"FY Kong","year":"2023","unstructured":"Kong FY, Miao CX, Huo YJ, Song JX, Zhang YZ (2023) Single-machine scheduling with step-deteriorating jobs and rejection. J Oper Res Soc China. https:\/\/doi.org\/10.1007\/s40305-023-00481-5","journal-title":"J Oper Res Soc China"},{"key":"887_CR11","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","volume":"174","author":"WH Kuo","year":"2006","unstructured":"Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174:1184\u20131190","journal-title":"Eur J Oper Res"},{"issue":"7","key":"887_CR12","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.3390\/math12071029","volume":"12","author":"MH Li","year":"2024","unstructured":"Li MH, Lv DY, Lu YY, Wang JB (2024) Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics 12(7):1029","journal-title":"Mathematics"},{"key":"887_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595920500141","author":"WW Liu","year":"2020","unstructured":"Liu WW, Jiang C (2020) Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights. Asia Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595920500141","journal-title":"Asia Pac J Oper Res"},{"issue":"8","key":"887_CR14","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1007\/s11590-022-01955-w","volume":"17","author":"YC Luo","year":"2023","unstructured":"Luo YC (2023) Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect. Optim Lett 17(8):1811\u20131832","journal-title":"Optim Lett"},{"key":"887_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595924500039","author":"DY Lv","year":"2024","unstructured":"Lv DY, Wang JB (2024) No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595924500039","journal-title":"Asia Pac J Oper Res"},{"issue":"4","key":"887_CR16","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.3934\/jimo.2018131","volume":"15","author":"CX Miao","year":"2019","unstructured":"Miao CX, Zhang YZ (2019) Scheduling with step-deteriorating jobs to minimize the makespan. J Ind Manag Optim 15(4):1955\u20131964","journal-title":"J Ind Manag Optim"},{"issue":"1","key":"887_CR17","doi-asserted-by":"publisher","first-page":"2240011","DOI":"10.1142\/S0217595922400115","volume":"40","author":"CX Miao","year":"2023","unstructured":"Miao CX, Kong FY, Zou J, Ma R, Huo YJ (2023) Parallel-machine scheduling with step-deteriorating jobs to minimize the total (weighted) completion time. Asia Pac J Oper Res 40(1):2240011. https:\/\/doi.org\/10.1142\/S0217595922400115","journal-title":"Asia Pac J Oper Res"},{"key":"887_CR18","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1057\/palgrave.jors.2601215","volume":"52","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165\u20131169","journal-title":"J Oper Res Soc"},{"issue":"4","key":"887_CR19","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/0360-8352(95)00006-M","volume":"28","author":"G Mosheiov","year":"1995","unstructured":"Mosheiov G (1995) Scheduling jobs with step-deterioration; minimizing makespan on a single-and multi-machine. Comput Ind Eng 28(4):869\u2013879","journal-title":"Comput Ind Eng"},{"key":"887_CR20","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"},{"key":"887_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1057\/jors.2011.40","volume":"63","author":"JB Wang","year":"2012","unstructured":"Wang JB, Wang MZ (2012) Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J Oper Res Soc 63:130\u2013137","journal-title":"J Oper Res Soc"},{"key":"887_CR22","doi-asserted-by":"publisher","first-page":"3179","DOI":"10.3390\/math11143179","volume":"11","author":"YC Wang","year":"2023","unstructured":"Wang YC, Wang JB (2023) Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics 11:3179","journal-title":"Mathematics"},{"issue":"3","key":"887_CR23","doi-asserted-by":"publisher","first-page":"2350026","DOI":"10.1142\/S0217595923500264","volume":"41","author":"JB Wang","year":"2024","unstructured":"Wang JB, Wang YC, Wan C, Lv DY, Zhang L (2024) Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia Pac J Oper Res 41(3):2350026","journal-title":"Asia Pac J Oper Res"},{"issue":"11","key":"887_CR24","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1080\/00207543.2016.1264642","volume":"55","author":"ZY Wang","year":"2017","unstructured":"Wang ZY, Wei CM, Sun LH (2017) Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect. Int J Prod Res 55(11):3141\u20133148","journal-title":"Int J Prod Res"},{"key":"887_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.2514\/8.155","volume":"10","author":"TP Wright","year":"1936","unstructured":"Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 10:122\u2013128","journal-title":"J Aeronaut Sci"},{"key":"887_CR26","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2020.09.014","volume":"289","author":"LY Yang","year":"2021","unstructured":"Yang LY, Lu XW (2021) Approximation algorithms for some position-dependent scheduling problems. Discrete Appl Math 289:22\u201331","journal-title":"Discrete Appl Math"},{"key":"887_CR27","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.3934\/jimo.2023136","volume":"20","author":"LH Zhang","year":"2024","unstructured":"Zhang LH, Geng XN, Xue J, Wang JB (2024) Single machine slack due window assignment and deteriorating jobs. J Ind Manag Optim 20:1593\u20131614","journal-title":"J Ind Manag Optim"},{"issue":"2","key":"887_CR28","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"LQ Zhang","year":"2016","unstructured":"Zhang LQ, Lu LF (2016) Parallel-machines scheduling with release datas and rejection. 4OR-Q J Oper Res 14(2):165\u2013172","journal-title":"4OR-Q J Oper Res"},{"issue":"3","key":"887_CR29","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang LQ, Lu LF, Yuan JJ (2009) Single-machine scheduling with release datas and rejection. Eur J Oper Res 198(3):975\u2013978","journal-title":"Eur J Oper Res"},{"issue":"5","key":"887_CR30","first-page":"741","volume":"11","author":"CL Zhao","year":"2004","unstructured":"Zhao CL, Zhang QL, Tang HY (2004) Machine scheduling problems with a learning effect. Dyn Contin Discrete Impuls Syst Ser A Math Anal 11(5):741\u2013750","journal-title":"Dyn Contin Discrete Impuls Syst Ser A Math Anal"},{"issue":"2","key":"887_CR31","first-page":"111","volume":"24","author":"YZ Zhang","year":"2020","unstructured":"Zhang YZ (2020) A survey on job scheduling with rejection. Oper Res T 24(2):111\u2013130","journal-title":"Oper Res T"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00887-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-024-00887-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00887-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T15:57:18Z","timestamp":1739894238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-024-00887-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["887"],"URL":"https:\/\/doi.org\/10.1007\/s12351-024-00887-w","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,15]]},"assertion":[{"value":"11 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2024","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 declare that they have no Conflict of interest and we thank the insightful comments and suggestions provided by the anonymous reviewers and editor.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}