{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:01Z","timestamp":1740182401500,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s43069-021-00096-7","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5278-5925","authenticated-orcid":false,"given":"Abbasali","family":"Jafari-Nodoushan","sequence":"first","affiliation":[]},{"given":"Hassan Khademi","family":"Zare","sequence":"additional","affiliation":[]},{"given":"M. M.","family":"Lotfi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Tavakkoli-Moghaddam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,25]]},"reference":[{"key":"96_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-020-01581-4","author":"B Liao","year":"2020","unstructured":"Liao B, Wang H, Zhu X, Yang S, Pardalos PM (2020) Improved DE search for competing groups scheduling with deterioration effects. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-020-01581-4","journal-title":"Optim Lett"},{"key":"96_CR2","first-page":"8750","volume":"218","author":"WC Lee","year":"2012","unstructured":"Lee WC, Lu ZS (2012) Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs. Appl Math Comput 218:8750\u20138757","journal-title":"Appl Math Comput"},{"key":"96_CR3","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s11590-019-01526-6","volume":"14","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G (2020) Minimizing total load on parallel machines with linear deterioration. Optim Lett 14:771\u2013779","journal-title":"Optim Lett"},{"key":"96_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10898-011-9767-1","volume":"54","author":"A Jafari","year":"2012","unstructured":"Jafari A, Moslehi G (2012) Scheduling linear deteriorating jobs to minimize the number of tardy jobs. J Glo Optim 54:389\u2013404","journal-title":"J Glo Optim"},{"key":"96_CR5","doi-asserted-by":"crossref","unstructured":"Lu S, Liu X, Pei J,\u00a0Pardalos PM (2021) Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. Optim Lett\u00a015:537\u2013551","DOI":"10.1007\/s11590-018-1322-2"},{"key":"96_CR6","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.cie.2010.06.017","volume":"59","author":"G Moslehi","year":"2010","unstructured":"Moslehi G, Jafari A (2010) Minimizing the number of tardy jobs under piecewise-linear deterioration. Comput Ind Eng 59:573\u2013584","journal-title":"Comput Ind Eng"},{"key":"96_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.cie.2007.08.006","volume":"54","author":"WC Lee","year":"2008","unstructured":"Lee WC, Wu CC, Chung YH (2008) Scheduling deteriorating jobs on a single machine with release times. Comput Ind Eng 54:441\u2013452","journal-title":"Comput Ind Eng"},{"key":"96_CR8","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.ijpe.2005.11.005","volume":"103","author":"CC Wu","year":"2006","unstructured":"Wu CC, Lee WC (2006) Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. Int J Prod Econ 103:572\u2013584","journal-title":"Int J Prod Econ"},{"key":"96_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.cor.2012.08.006","volume":"40","author":"JB Wang","year":"2013","unstructured":"Wang JB, Wang MZ (2013) Minimizing makespan in three-machine flow shops with deteriorating jobs. Comput Oper Res 40:547\u2013557","journal-title":"Comput Oper Res"},{"key":"96_CR10","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 TCE, Liu LL (2010) A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput Oper Res 37:83\u201390","journal-title":"Comput Oper Res"},{"key":"96_CR11","doi-asserted-by":"crossref","unstructured":"Li K, Chen J, Fu H, Jia Z, Wu J (2020) Parallel machine scheduling with position-based deterioration and learning effects in an uncertain manufacturing system\u00a0149\u00a0106858","DOI":"10.1016\/j.cie.2020.106858"},{"key":"96_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.cie.2007.10.010","volume":"54","author":"WC Lee","year":"2008","unstructured":"Lee WC, Wu CC, Wen CC, Chung YH (2008) A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput Ind Eng 54:737\u2013749","journal-title":"Comput Ind Eng"},{"key":"96_CR13","first-page":"4819","volume":"217","author":"SH Yang","year":"2011","unstructured":"Yang SH, Wang JB (2011) Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl Math Comput 217:4819\u20134826","journal-title":"Appl Math Comput"},{"key":"96_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ijpe.2010.01.021","volume":"125","author":"L Wang","year":"2010","unstructured":"Wang L, Sun LY, Sun LH, Wang JB (2010) On three-machine flow shop scheduling with deteriorating jobs. Int J Prod Econ 125:185\u2013189","journal-title":"Int J Prod Econ"},{"key":"96_CR15","first-page":"185","volume":"180","author":"JB Wang","year":"2006","unstructured":"Wang JB, Ng CTD, Chen TCE, Liu LL (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185\u2013193","journal-title":"Appl Math Comput"},{"key":"96_CR16","doi-asserted-by":"crossref","unstructured":"Liu S, Pei J, Cheng H, Liu X, Pardalos PM (2019) Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes. App Soft Comput J\u00a084, 105701","DOI":"10.1016\/j.asoc.2019.105701"},{"key":"96_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2019.06.015","volume":"111","author":"S Sanchez-Herrera","year":"2019","unstructured":"Sanchez-Herrera S, Montoya-Torres JR, Solano-Charris EL (2019) Flow shop scheduling problem with position-dependent processing times. Comput Oper Res 111:325\u2013345","journal-title":"Comput Oper Res"},{"key":"96_CR18","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6","volume":"45","author":"W Kubiak","year":"1998","unstructured":"Kubiak W, Velde S (1998) Scheduling Deteriorating Jobs to Minimize Makespan. Nav Res Logist 45:511\u2013523","journal-title":"Nav Res Logist"},{"key":"96_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1\u201313","journal-title":"Eur J Oper Res"},{"key":"96_CR20","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: Theory, algorithms and systems. Prentice Hall, Upper Saddle River"},{"key":"96_CR21","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.promfg.2020.01.358","volume":"39","author":"YB Woo","year":"2019","unstructured":"Woo YB, Kim BS, Moon I (2019) Column Generation Algorithms for a Single Machine Problem with Deteriorating Jobs and Deterioration Maintenance Activities. Procedia Manufactur 39:1119\u20131128","journal-title":"Procedia Manufactur"},{"key":"96_CR22","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653\u2013659","journal-title":"Comput Oper Res"},{"key":"96_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei J, Cheng B, Liu X, Pardalos PM, Kong M (2019) Single-machine and parallel-machine serial- batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272:217\u2013241","journal-title":"Ann Oper Res"},{"key":"96_CR24","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.cie.2011.05.010","volume":"61","author":"WC Lee","year":"2011","unstructured":"Lee WC, Lin JB, Shiau YR (2011) Deteriorating job scheduling to minimize the number of late jobs with setup times. Comput Ind Eng 61:782\u2013787","journal-title":"Comput Ind Eng"},{"key":"96_CR25","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11590-019-01389-x","volume":"14","author":"M Kong","year":"2019","unstructured":"Kong M, Liu X, Pei J, Zhou Z, Pardalos PM (2019) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett 14:857\u2013871","journal-title":"Optim Lett"},{"key":"96_CR26","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1016\/j.cor.2010.11.014","volume":"38","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Hsu CJ, Huang YC, Lee WC (2011) Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Comput Oper Res 38:1760\u20131765","journal-title":"Comput Oper Res"},{"key":"96_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cie.2016.05.028","volume":"98","author":"BD Chung","year":"2016","unstructured":"Chung BD, Kim BS (2016) A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities. Comput Ind Eng 98:113\u2013124","journal-title":"Comput Ind Eng"},{"key":"96_CR28","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.advengsoft.2009.03.018","volume":"40","author":"J Layegh","year":"2009","unstructured":"Layegh J, Jolai F, Amalnik MS (2009) A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration. Advances Eng Softw 40:1074\u20131077","journal-title":"Advances Eng Softw"},{"key":"96_CR29","doi-asserted-by":"crossref","unstructured":"Cheng TCE, Kravchenko SA, Lin BMT (2020) Scheduling Step-deteriorating Jobs to Minimize the Total Completion Time. Comput Ind Eng\u00a0144, 106329","DOI":"10.1016\/j.cie.2020.106329"},{"key":"96_CR30","first-page":"778","volume":"29","author":"A Jafari","year":"2016","unstructured":"Jafari A, Khademi-zare H, Lotfi MM, Tavakkoli-Moghaddam R (2016) Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop. Int J Eng IJE TRANSACTIONS B: Applications 29:778\u2013787","journal-title":"Int J Eng IJE TRANSACTIONS B: Applications"},{"key":"96_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2016.02.001","volume":"72","author":"A Jafari","year":"2016","unstructured":"Jafari A, Khademi-zare H, Lotfi MM, Tavakkoli-Moghaddam R (2016) A note on \u201cminimizing makespan in three machine flowshop with deteriorating jobs.\u201d Comput Oper Res 72:93\u201396","journal-title":"Comput Oper Res"},{"key":"96_CR32","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.ijpe.2017.06.011","volume":"191","author":"A Jafari","year":"2017","unstructured":"Jafari A, Khademi-zare H, Lotfi MM, Tavakkoli-Moghaddam R (2017) A note on \u201cOn three-machine flow shop scheduling with deteriorating jobs.\u201d Int J Prod Econ 191:250\u2013252","journal-title":"Int J Prod Econ"},{"key":"96_CR33","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1016\/j.cor.2010.01.006","volume":"37","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Sarig A, Sidney J (2010) The Browne-Yechiali single-machine sequence is optimal for flow-shops. Comput Oper Res 37:1965\u20131967","journal-title":"Comput Oper Res"},{"key":"96_CR34","doi-asserted-by":"publisher","first-page":"3081","DOI":"10.1016\/j.apm.2013.11.031","volume":"38","author":"WC Lee","year":"2014","unstructured":"Lee WC, Yeh WC, Chung YH (2014) Total tardiness minimization in permutation flowshop with deterioration consideration. Appl Math Model 38:3081\u20133092","journal-title":"Appl Math Model"},{"key":"96_CR35","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2017.12.001","volume":"721","author":"Y Ouazene","year":"2018","unstructured":"Ouazene Y, Yalaoui F (2018) Identical parallel machine scheduling with time-dependent processing times. Theoretical Comput Sci 721:70\u201377","journal-title":"Theoretical Comput Sci"},{"key":"96_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/00207720802095160","volume":"40","author":"M Cheng","year":"2009","unstructured":"Cheng M, Wang G, He L (2009) Parallel machine scheduling problems with proportionally deteriorating jobs. Int J Syst Sci 40:53\u201357","journal-title":"Int J Syst Sci"},{"key":"96_CR37","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":"96_CR38","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":"96_CR39","unstructured":"Brucker P (2006) Scheduling algorithms. Berlin, Heidelberg (2006)"},{"key":"96_CR40","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Comput Oper Res 38:495\u2013498","journal-title":"Comput Oper Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00096-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00096-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00096-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T06:20:13Z","timestamp":1640586013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00096-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,25]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00096-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,9,25]]},"assertion":[{"value":"12 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors notify that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"49"}}