{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:16Z","timestamp":1777755496911,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"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":[[2023,3]]},"DOI":"10.1007\/s12351-023-00754-0","type":"journal-article","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T10:46:45Z","timestamp":1676803605000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,18]]},"reference":[{"issue":"2","key":"754_CR1","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s00500-020-05234-7","volume":"25","author":"OA Ar\u0131k","year":"2021","unstructured":"Ar\u0131k OA (2021) Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft Comput 25(2):1501\u20131518","journal-title":"Soft Comput"},{"issue":"3","key":"754_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0377-2217(00)00284-8","volume":"134","author":"TCE Cheng","year":"2001","unstructured":"Cheng TCE, Ding Q (2001) Single machine scheduling with step-deteriorating processing times. Eur J Oper Res 134(3):623\u2013630","journal-title":"Eur J Oper Res"},{"key":"754_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent scheduling. Springer Science & Business Media, Berlin"},{"key":"754_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2016.02.001","volume":"72","author":"AA Jafari","year":"2016","unstructured":"Jafari AA, Khademi-Zare H, Lotfi MM, Tavakkoli-Moghaddam R (2016) A note on \u201cminimizing makespan in three machine flow shop with deteriorating jobs.\u201d Comput Oper Res 72:93\u201396","journal-title":"Comput Oper Res"},{"issue":"3","key":"754_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1057\/palgrave.jors.2601693","volume":"55","author":"AAK Jeng","year":"2004","unstructured":"Jeng AAK, Lin BM (2004) Makespan minimization in single-machine scheduling with step-deterioration of processing times. J Oper Res Soc 55(3):247\u2013256","journal-title":"J Oper Res Soc"},{"issue":"4","key":"754_CR6","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11590-019-01389-x","volume":"14","author":"M Kong","year":"2020","unstructured":"Kong M, Liu X, Pei J, Zhou Z, Pardalos PM (2020) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett 14(4):857\u2013871","journal-title":"Optim Lett"},{"issue":"1","key":"754_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejor.2016.04.010","volume":"255","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz E, Vo\u00df S (2016) Modeling the parallel machine scheduling problem with step deteriorating jobs. Eur J Oper Res 255(1):21\u201333","journal-title":"Eur J Oper Res"},{"issue":"6","key":"754_CR8","doi-asserted-by":"publisher","first-page":"2111","DOI":"10.1016\/j.cor.2008.07.008","volume":"36","author":"WC Lee","year":"2009","unstructured":"Lee WC, Wu CC, Chung YH, Liu HC (2009) Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. Comput Oper Res 36(6):2111\u20132121","journal-title":"Comput Oper Res"},{"issue":"04","key":"754_CR9","doi-asserted-by":"publisher","first-page":"1750015","DOI":"10.1142\/S0217595917500154","volume":"34","author":"SS Li","year":"2017","unstructured":"Li SS, Qian DL, Chen RX (2017) Proportionate flow shop scheduling with rejection. Asia-Pacific J Oper Res 34(04):1750015","journal-title":"Asia-Pacific J Oper Res"},{"issue":"4","key":"754_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10898-018-0707-1","volume":"78","author":"B Liao","year":"2020","unstructured":"Liao B, Song Q, Pei J, Yang S, Pardalos PM (2020) Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration. J Global Optim 78(4):717\u2013742","journal-title":"J Global Optim"},{"issue":"8","key":"754_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/nav.21508","volume":"59","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012) Batch scheduling with step-deteriorating processing times to minimize flowtime. Nav Res Logist 59(8):587\u2013600","journal-title":"Nav Res Logist"},{"issue":"12","key":"754_CR12","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1057\/s41274-016-0003-8","volume":"67","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc 67(12):1524\u20131531","journal-title":"J Oper Res Soc"},{"issue":"3","key":"754_CR13","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":"754_CR14","doi-asserted-by":"publisher","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 Ind Eng 169:108168","journal-title":"Comput Ind Eng"},{"issue":"11","key":"754_CR15","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":"3","key":"754_CR16","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s11590-021-01763-8","volume":"16","author":"B Mor","year":"2022","unstructured":"Mor B, Shapira D (2022a) Minsum scheduling with acceptable lead-times and optional job rejection. Optim Lett 16(3):1073\u20131091","journal-title":"Optim Lett"},{"key":"754_CR17","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s10878-022-00845-2","volume":"44","author":"B Mor","year":"2022","unstructured":"Mor B, Shapira D (2022b) Single machine scheduling with non-availability interval and optional job rejection. J Comb Optim 44:480\u2013497","journal-title":"J Comb Optim"},{"issue":"6","key":"754_CR18","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":"4","key":"754_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"},{"issue":"1","key":"754_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2009.03.019","volume":"37","author":"CT Ng","year":"2010","unstructured":"Ng CT, Wang JB, Cheng TE, Liu LL (2010) A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput Oper Res 37(1):83\u201390","journal-title":"Comput Oper Res"},{"key":"754_CR21","doi-asserted-by":"publisher","first-page":"102313","DOI":"10.1016\/j.omega.2020.102313","volume":"102","author":"D Oron","year":"2021","unstructured":"Oron D (2021) Two-agent scheduling problems under rejection budget constraints. Omega 102:102313","journal-title":"Omega"},{"key":"754_CR22","doi-asserted-by":"publisher","first-page":"108023","DOI":"10.1016\/j.asoc.2021.108023","volume":"113","author":"R Rudek","year":"2021","unstructured":"Rudek R (2021) A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves. Appl Soft Comput 113:108023","journal-title":"Appl Soft Comput"},{"key":"754_CR23","doi-asserted-by":"publisher","first-page":"107632","DOI":"10.1016\/j.asoc.2021.107632","volume":"110","author":"M Salama","year":"2021","unstructured":"Salama M, Srinivas S (2021) Adaptive neighborhood simulated annealing for sustainability-oriented single machine scheduling with deterioration effect. Appl Soft Comput 110:107632","journal-title":"Appl Soft Comput"},{"key":"754_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00766-2","author":"D Shabtay","year":"2022","unstructured":"Shabtay D, Mor B (2022) Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J Sched. https:\/\/doi.org\/10.1007\/s10951-022-00766-2","journal-title":"J Sched"},{"issue":"1","key":"754_CR25","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(1):3\u201328","journal-title":"J Sched"},{"key":"754_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"VA Strusevich","year":"2017","unstructured":"Strusevich VA, Rustogi K (2017) Scheduling with time-changing effects and rate-modifying activities. Springer International Publishing, Cham, Switzerland"},{"issue":"12","key":"754_CR27","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1080\/00207543.2015.1136081","volume":"54","author":"DJ Wang","year":"2016","unstructured":"Wang DJ, Yin Y, Liu M (2016) Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. Int J Prod Res 54(12):3691\u20133705","journal-title":"Int J Prod Res"},{"key":"754_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cor.2018.02.017","volume":"95","author":"YB Woo","year":"2018","unstructured":"Woo YB, Kim BS (2018) Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput Oper Res 95:97\u2013112","journal-title":"Comput Oper Res"},{"key":"754_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cie.2017.05.007","volume":"109","author":"YB Woo","year":"2017","unstructured":"Woo YB, Jung S, Kim BS (2017) A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput Ind Eng 109:179\u2013190","journal-title":"Comput Ind Eng"},{"key":"754_CR30","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"X Wu","year":"2019","unstructured":"Wu X, Shen X, Li C (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004\u20131024","journal-title":"Comput Ind Eng"},{"issue":"4","key":"754_CR31","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 (2017) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR 15(4):387\u2013406","journal-title":"4OR"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-023-00754-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:29:20Z","timestamp":1679869760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-023-00754-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,18]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["754"],"URL":"https:\/\/doi.org\/10.1007\/s12351-023-00754-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,18]]},"assertion":[{"value":"4 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2023","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 conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}