{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:08:05Z","timestamp":1778947685787,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the national key research and development program of china","award":["2019YFB1705300"],"award-info":[{"award-number":["2019YFB1705300"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s12351-022-00720-2","type":"journal-article","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T06:04:20Z","timestamp":1655445860000},"page":"5405-5440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A hybrid metaheuristic for a semiconductor production scheduling problem with deterioration effect and resource constraints"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9195-4376","authenticated-orcid":false,"given":"Shaojun","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiping","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siwen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,17]]},"reference":[{"key":"720_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung YT (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84\u2013100","journal-title":"Comput Ind Eng"},{"issue":"2","key":"720_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11590-016-1004-x","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg J, Mladenovi\u0107 N, Todosijevi\u0107 R, Uro\u0161evi\u0107 D (2017) General variable neighborhood search for the uncapacitated single allocation p -hub center problem. Optim Lett 11(2):377\u2013388","journal-title":"Optim Lett"},{"issue":"12","key":"720_CR3","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(12):1760\u20131765","journal-title":"Comput Oper Res"},{"issue":"1","key":"720_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TE Cheng","year":"2004","unstructured":"Cheng TE, Ding Q, Lin BM (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152(1):1\u201313","journal-title":"Eur J Oper Res"},{"issue":"1","key":"720_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-019-03352-6","volume":"298","author":"X Chai","year":"2021","unstructured":"Chai X, Li W, Zhu Y (2021) Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. Ann Oper Res 298(1):79\u201393","journal-title":"Ann Oper Res"},{"issue":"1","key":"720_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7(1):1\u201317","journal-title":"SIAM J Comput"},{"issue":"5","key":"720_CR7","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1111\/itor.12195","volume":"24","author":"MA Cruz-Ch\u00e1vez","year":"2015","unstructured":"Cruz-Ch\u00e1vez MA, Mart\u00ednez-Rangel MG, Cruz-Rosales MH (2015) Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem. Int Trans Oper Res 24(5):1119\u20131137","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"720_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"S Dan","year":"2008","unstructured":"Dan S (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"key":"720_CR9","doi-asserted-by":"crossref","unstructured":"Fan W, Pei J, Liu X, Pardalos PM, Kong M (2017) Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. J Glob Optim, pp 1\u201317","DOI":"10.1007\/s10898-017-0536-7"},{"issue":"1","key":"720_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2021","unstructured":"Fowler JW, M\u00f6nch L (2021) A survey of scheduling with parallel batch (p-batch) processing. Eur J Oper Res 298(1):1\u201324","journal-title":"Eur J Oper Res"},{"key":"720_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-022-01857-x","author":"ER Gafarov","year":"2022","unstructured":"Gafarov ER, Dolgui A (2022) On lower and upper bounds for single machine parallel batch scheduling. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-022-01857-x","journal-title":"Optim Lett"},{"issue":"1","key":"720_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ejor.2018.07.040","volume":"273","author":"Y Gao","year":"2019","unstructured":"Gao Y, Yuan J, Ng CT, Cheng TCE (2019) A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur J Oper Res 273(1):74\u201381","journal-title":"Eur J Oper Res"},{"key":"720_CR13","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 and Business Media, Berlin"},{"issue":"1","key":"720_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.4236\/jcc.2018.61024","volume":"06","author":"X Geng","year":"2018","unstructured":"Geng X, Wang J, Hsu CJ (2018) Flow shop scheduling problem with convex resource allocation and learning effect. J Comput Commun 06(1):239\u2013246","journal-title":"J Comput Commun"},{"issue":"9","key":"720_CR15","first-page":"2749","volume":"216","author":"W Gong","year":"2010","unstructured":"Gong W, Cai Z, Ling CX, Li H (2010) A real-coded biogeography-based optimization with mutation. Appl Math Comput 216(9):2749\u20132758","journal-title":"Appl Math Comput"},{"issue":"1","key":"720_CR16","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, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(1):287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"720_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura Y, Gimple M (1986) Efficient scheduling algorithms for a single batch processing machine. Oper Res Lett 5(2):61\u201365","journal-title":"Oper Res Lett"},{"key":"720_CR18","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00170-005-2529-9","volume":"29","author":"J Jerald","year":"2006","unstructured":"Jerald J, Asokan P, Saravanan R (2006) Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm. Int J Adv Manuf Technol 29:584\u2013589","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"720_CR19","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.cie.2010.08.005","volume":"59","author":"M Ji","year":"2010","unstructured":"Ji M, Cheng TE (2010) Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan. Comput Ind Eng 59(4):794\u2013798","journal-title":"Comput Ind Eng"},{"issue":"3","key":"720_CR20","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(3):441\u2013452","journal-title":"Comput Ind Eng"},{"key":"720_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00170-021-07228-7","volume":"115","author":"MK Marichelvam","year":"2021","unstructured":"Marichelvam MK, Geetha M (2021) A memetic algorithm to solve uncertain energy-efficient flow shop scheduling problems. Int J Adv Manuf Technol 115:515\u2013530","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"720_CR22","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"720_CR23","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107 N, Todosijevi\u0107 R, Uro\u0161evi\u0107 D (2016) Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf Sci 326:160\u2013171","journal-title":"Inf Sci"},{"key":"720_CR24","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s12351-019-00477-1","volume":"21","author":"M Milenkovi\u0107","year":"2021","unstructured":"Milenkovi\u0107 M, Milosavljevic N, Bojovi\u0107 N, Val., S. (2021) Container flow forecasting through neural networks based on metaheuristics. Oper Res Int Journal 21:965\u2013997","journal-title":"Oper Res Int Journal"},{"issue":"11","key":"720_CR25","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput Oper Res 32(11):2731\u20132750","journal-title":"Comput Oper Res"},{"issue":"4","key":"720_CR26","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/moor.15.4.736","volume":"15","author":"CL Monma","year":"1990","unstructured":"Monma CL, Schrijver A, Todd MJ, Wei VK (1990) Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions. Math Oper Res 15(4):736\u2013748","journal-title":"Math Oper Res"},{"issue":"19","key":"720_CR27","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.ipl.2011.07.005","volume":"111","author":"D Oron","year":"2011","unstructured":"Oron D (2011) Scheduling a batching machine with convex resource consumption functions. Inf Process Lett 111(19):962\u2013967","journal-title":"Inf Process Lett"},{"issue":"1","key":"720_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1057\/jors.2013.5","volume":"65","author":"D Oron","year":"2014","unstructured":"Oron D (2014) Scheduling controllable processing time jobs in a deteriorating environment. J Oper Res Soc 65(1):49\u201356","journal-title":"J Oper Res Soc"},{"key":"720_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.12.003","author":"J Pei","year":"2017","unstructured":"Pei J, Liu X, Fan W, Pardalos PM, Lu S (2017a) A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega. https:\/\/doi.org\/10.1016\/j.omega.2017.12.003","journal-title":"Omega"},{"issue":"1\u20132","key":"720_CR30","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10479-015-1824-6","volume":"249","author":"J Pei","year":"2017","unstructured":"Pei J, Liu X, Pardalos PM, Fan W, Yang S (2017b) Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Ann Oper Res 249(1\u20132):175\u2013195","journal-title":"Ann Oper Res"},{"issue":"2","key":"720_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: A review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"issue":"8","key":"720_CR32","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1016\/S0305-0548(03)00081-9","volume":"31","author":"D Shabtay","year":"2004","unstructured":"Shabtay D (2004) Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Comput Oper Res 31(8):1303\u20131315","journal-title":"Comput Oper Res"},{"key":"720_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-021-00620-x","author":"K Shao","year":"2021","unstructured":"Shao K, Fan W, Yang Z, Yang S, Pardalos PM (2021) A column generation approach for patient scheduling with setup time and deteriorating treatment duration. Oper Res Int Journal. https:\/\/doi.org\/10.1007\/s12351-021-00620-x","journal-title":"Oper Res Int Journal"},{"issue":"1","key":"720_CR34","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TASE.2014.2360530","volume":"12","author":"J Song","year":"2015","unstructured":"Song J, Shi Z, Sun B, Shi L (2015) Treatment planning for volumetric-modulated arc therapy: Model and heuristic algorithms. IEEE Trans Autom Sci Eng 12(1):116\u2013126","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"7","key":"720_CR35","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1108\/EC-10-2012-0232","volume":"31","author":"GG Wang","year":"2014","unstructured":"Wang GG, Hossein Gandomi A, Yang XS, Hossein Alavi A (2014) A novel improved accelerated particle swarm optimization algorithm for global numerical optimization. Eng Comput 31(7):1198\u20131220","journal-title":"Eng Comput"},{"issue":"4","key":"720_CR36","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1016\/j.apm.2012.05.025","volume":"37","author":"XR Wang","year":"2013","unstructured":"Wang XR, Wang JJ (2013) Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl Math Model 37(4):2388\u20132393","journal-title":"Appl Math Model"},{"issue":"2","key":"720_CR37","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.apm.2011.07.005","volume":"36","author":"CM Wei","year":"2012","unstructured":"Wei CM, Wang JB, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 36(2):792\u2013798","journal-title":"Appl Math Model"},{"issue":"3","key":"720_CR38","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2011.05.011","volume":"39","author":"R Xu","year":"2012","unstructured":"Xu R, Chen H, Li X (2012) Makespan minimization on single batch-processing machine via ant colony optimization. Comput Oper Res 39(3):582\u2013593","journal-title":"Comput Oper Res"},{"key":"720_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105675","volume":"140","author":"H Zhang","year":"2022","unstructured":"Zhang H, Yang Y, Wu F (2022) Just-in-time single-batch-processing machine scheduling. Comput Oper Res 140:105675","journal-title":"Comput Oper Res"},{"key":"720_CR40","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jmsy.2015.12.002","volume":"38","author":"C Zhao","year":"2016","unstructured":"Zhao C, Hsu CJ, Wu WH, Cheng SR, Wu CC (2016) Note on a unified approach to the single-machine scheduling problem with a deterioration effect and convex resource allocation. J Manuf Syst 38:134\u2013140","journal-title":"J Manuf Syst"},{"key":"720_CR41","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.eswa.2019.02.023","volume":"126","author":"F Zhao","year":"2019","unstructured":"Zhao F, Qin S, Zhang Y, Ma W, Zhang C, Song H (2019) A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem. Expert Syst Appl 126:321\u2013339","journal-title":"Expert Syst Appl"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-022-00720-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T14:11:53Z","timestamp":1666361513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-022-00720-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s12351-022-00720-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]},"assertion":[{"value":"23 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no potential conflicts of interest for this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All algorithms have been implemented in C++ language and executed on an Inter Core 7, 3.6GHZ PC with 8\u00a0GB of RAM.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}