{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T19:44:31Z","timestamp":1780343071942,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871076"],"award-info":[{"award-number":["71871076"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"crossref","award":["2208085J07"],"award-info":[{"award-number":["2208085J07"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"crossref","award":["2208085MG179"],"award-info":[{"award-number":["2208085MG179"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["202106690018"],"award-info":[{"award-number":["202106690018"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["72271070"],"award-info":[{"award-number":["72271070"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12351-024-00829-6","type":"journal-article","created":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T09:01:51Z","timestamp":1712998911000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints"],"prefix":"10.1007","volume":"24","author":[{"given":"Jianfu","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abderrahim","family":"Sahli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"829_CR1","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.cie.2016.07.028","volume":"99","author":"K Abd","year":"2016","unstructured":"Abd K, Abhary K, Marian R (2016) Multi-objective optimisation of dynamic scheduling in robotic flexible assembly cells via fuzzy-based Taguchi approach. Comput Ind Eng 99:250\u2013259","journal-title":"Comput Ind Eng"},{"key":"829_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","volume":"98","author":"M Afzalirad","year":"2016","unstructured":"Afzalirad M, Rezaeian J (2016) Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Comput Ind Eng 98:40\u201352","journal-title":"Comput Ind Eng"},{"key":"829_CR3","doi-asserted-by":"publisher","first-page":"171533","DOI":"10.1109\/ACCESS.2019.2955975","volume":"7","author":"IM Al-Harkan","year":"2019","unstructured":"Al-Harkan IM, Qamhan AA (2019) Optimize unrelated parallel machines scheduling problems with multiple limited additional resources, sequence-dependent setup times and release date constraints. IEEE Access 7:171533\u2013171547","journal-title":"IEEE Access"},{"issue":"3","key":"829_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","volume":"70","author":"B Alidaee","year":"1993","unstructured":"Alidaee B, Ahmadian A (1993) Two parallel machine sequencing problems involving controllable job processing times. Eur J Oper Res 70(3):335\u2013341","journal-title":"Eur J Oper Res"},{"key":"829_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","volume":"104","author":"A Azadeh","year":"2017","unstructured":"Azadeh A, Elahi S, Farahani MH et al (2017) A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput Ind Eng 104:124\u2013133","journal-title":"Comput Ind Eng"},{"issue":"17","key":"829_CR6","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.ins.2011.04.010","volume":"181","author":"S Balin","year":"2011","unstructured":"Balin S (2011) Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation. Inf Sci 181(17):3551\u20133569","journal-title":"Inf Sci"},{"key":"829_CR7","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Ecker KH, Pesch E, et\u00a0al (2019) Handbook on scheduling: from theory to practice. Springer","DOI":"10.1007\/978-3-319-99849-7"},{"issue":"4","key":"829_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen B, Vestjens APA (1997) Scheduling on identical machines: How good is lpt in an on-line setting? Oper Res Lett 21(4):165\u2013169","journal-title":"Oper Res Lett"},{"key":"829_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen R, Yang B, Li S et al (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng 149:1\u201312","journal-title":"Comput Ind Eng"},{"key":"829_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2016.11.008","volume":"80","author":"WW Cui","year":"2017","unstructured":"Cui WW, Lu Z (2017) Minimizing the makespan on a single machine with flexible maintenances and jobs\u2019 release dates. Comput Oper Res 80:11\u201322","journal-title":"Comput Oper Res"},{"key":"829_CR11","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1007\/s10462-022-10247-9","volume":"56","author":"M Durasevi\u0107","year":"2023","unstructured":"Durasevi\u0107 M, Jakobovi\u0107 D (2023) Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artif Intell Rev 56:3181\u20133289","journal-title":"Artif Intell Rev"},{"issue":"3","key":"829_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","volume":"230","author":"EB Edis","year":"2013","unstructured":"Edis EB, Oguz C, Ozkarahan I (2013) Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur J Oper Res 230(3):449\u2013463","journal-title":"Eur J Oper Res"},{"issue":"4","key":"829_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"A Gharbi","year":"2002","unstructured":"Gharbi A, Haouari M (2002) Minimizing makespan on parallel machines subject to release dates and delivery times. J Sched 5(4):329\u2013355","journal-title":"J Sched"},{"key":"829_CR14","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 et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"issue":"1","key":"829_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(84)90035-X","volume":"5","author":"D Gusfield","year":"1984","unstructured":"Gusfield D (1984) Bounds for Naive multiple machine scheduling with release times and deadlines. J Algorithms 5(1):1\u20136","journal-title":"J Algorithms"},{"issue":"1","key":"829_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ejor.2016.09.007","volume":"258","author":"P Gy\u00f6rgyi","year":"2017","unstructured":"Gy\u00f6rgyi P, Kis T (2017) Approximation schemes for parallel machine scheduling with non-renewable resources. Eur J Oper Res 258(1):113\u2013123","journal-title":"Eur J Oper Res"},{"key":"829_CR17","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.cie.2014.05.026","volume":"74","author":"M Hajiaghaei-Keshteli","year":"2014","unstructured":"Hajiaghaei-Keshteli M, Aminnayeri M, Fatemi Ghomi SMT (2014) Integrated scheduling of production and rail transportation. Comput Ind Eng 74:240\u2013256","journal-title":"Comput Ind Eng"},{"key":"829_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ress.2015.06.002","volume":"142","author":"CL Huang","year":"2015","unstructured":"Huang CL (2015) A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems. Reliab Eng Syst Saf 142:221\u2013230","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"829_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61\u201368","journal-title":"Nav Res Logist Q"},{"issue":"9","key":"829_CR20","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1080\/0305215X.2011.628388","volume":"44","author":"CM Joo","year":"2012","unstructured":"Joo CM, Kim BS (2012) Parallel machine scheduling problem with ready times, due times and sequence-dependent setup times using meta-heuristic algorithms. Eng Optim 44(9):1021\u20131034","journal-title":"Eng Optim"},{"issue":"2","key":"829_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0377-2217(99)00156-3","volume":"120","author":"G Lancia","year":"2000","unstructured":"Lancia G (2000) Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. Eur J Oper Res 120(2):277\u2013288","journal-title":"Eur J Oper Res"},{"key":"829_CR22","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jmsy.2015.11.006","volume":"38","author":"K Li","year":"2016","unstructured":"Li K, Zhang X, Leung JYT et al (2016) Parallel machine scheduling problems in green manufacturing industry. J Manuf Syst 38:98\u2013106","journal-title":"J Manuf Syst"},{"key":"829_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2019.105585","volume":"82","author":"K Li","year":"2019","unstructured":"Li K, Chen J, Fu H et al (2019) Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint. Appl Soft Comput 82:1\u201313","journal-title":"Appl Soft Comput"},{"key":"829_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2020.106858","volume":"149","author":"K Li","year":"2020","unstructured":"Li K, Chen J, Fu H et al (2020) Parallel machine scheduling with position-based deterioration and learning effects in an uncertain manufacturing system. Comput Ind Eng 149:1\u201312","journal-title":"Comput Ind Eng"},{"issue":"2","key":"829_CR25","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","volume":"184","author":"LW Liao","year":"2008","unstructured":"Liao LW, Sheen GJ (2008) Parallel machine scheduling with machine availability and eligibility constraints. Eur J Oper Res 184(2):458\u2013467","journal-title":"Eur J Oper Res"},{"key":"829_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.asoc.2017.03.004","volume":"56","author":"TW Liao","year":"2017","unstructured":"Liao TW, Su P (2017) Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness. Appl Soft Comput 56:65\u201381","journal-title":"Appl Soft Comput"},{"key":"829_CR27","first-page":"1","volume":"2013","author":"YK Lin","year":"2013","unstructured":"Lin YK (2013) Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates. Math Probl Eng 2013:1\u20139","journal-title":"Math Probl Eng"},{"key":"829_CR28","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.asoc.2015.12.035","volume":"41","author":"MSS Mir","year":"2016","unstructured":"Mir MSS, Rezaeian J (2016) A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines. Appl Soft Comput 41:488\u2013504","journal-title":"Appl Soft Comput"},{"issue":"2","key":"829_CR29","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18(2):193","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"829_CR30","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0377-2217(94)90359-X","volume":"79","author":"L \u00d6zdamar","year":"1994","unstructured":"\u00d6zdamar L, Ulusoy G (1994) A local constraint based analysis approach to project scheduling under general resource constraints. Eur J Oper Res 79(2):287\u2013298","journal-title":"Eur J Oper Res"},{"key":"829_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.cie.2015.02.014","volume":"83","author":"KE Parsopoulos","year":"2015","unstructured":"Parsopoulos KE, Konstantaras I, Skouri K (2015) Metaheuristic optimization for the single-item dynamic lot sizing problem with returns and remanufacturing. Comput Ind Eng 83:307\u2013315","journal-title":"Comput Ind Eng"},{"issue":"3","key":"829_CR32","first-page":"230","volume":"21","author":"M Pfund","year":"2004","unstructured":"Pfund M, Fowler JW, Gupta JND (2004) A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. J Chin Inst Eng 21(3):230\u2013241","journal-title":"J Chin Inst Eng"},{"key":"829_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems, 5th edn. Springer, New York","edition":"5"},{"key":"829_CR34","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.jclepro.2019.01.166","volume":"217","author":"H Safarzadeh","year":"2019","unstructured":"Safarzadeh H, Niaki STA (2019) Bi-objective green scheduling in uniform parallel machine environments. J Clean Prod 217:559\u2013572","journal-title":"J Clean Prod"},{"issue":"1","key":"829_CR35","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D Shabtay","year":"2006","unstructured":"Shabtay D, Kaspi M (2006) Parallel machine scheduling with a convex resource consumption function. Eur J Oper Res 173(1):92\u2013107","journal-title":"Eur J Oper Res"},{"key":"829_CR36","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cie.2016.09.018","volume":"101","author":"N Suhaimi","year":"2016","unstructured":"Suhaimi N, Nguyen C, Damodaran P (2016) Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Comput Ind Eng 101:295\u2013302","journal-title":"Comput Ind Eng"},{"key":"829_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cie.2016.05.017","volume":"98","author":"BH Tabrizi","year":"2016","unstructured":"Tabrizi BH, Ghaderi SF (2016) A robust bi-objective model for concurrent planning of project scheduling and material procurement. Comput Ind Eng 98:11\u201329","journal-title":"Comput Ind Eng"},{"issue":"4","key":"829_CR38","doi-asserted-by":"publisher","first-page":"8204","DOI":"10.1016\/j.eswa.2008.10.004","volume":"36","author":"WC Yeh","year":"2009","unstructured":"Yeh WC, Chang WW, Chung YY (2009) A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method. Expert Syst Appl 36(4):8204\u20138211","journal-title":"Expert Syst Appl"},{"issue":"8","key":"829_CR39","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1016\/j.apm.2014.10.012","volume":"39","author":"WC Yeh","year":"2015","unstructured":"Yeh WC, Chuang MC, Lee WC (2015) Uniform parallel machine scheduling with resource consumption constraint. Appl Math Model 39(8):2131\u20132138","journal-title":"Appl Math Model"},{"issue":"3","key":"829_CR40","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.ejor.2018.07.012","volume":"272","author":"H Zhang","year":"2019","unstructured":"Zhang H, Xie J, Ge J et al (2019) A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar. Eur J Oper Res 272(3):868\u2013878","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00829-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-024-00829-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00829-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T13:23:56Z","timestamp":1720790636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-024-00829-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,13]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["829"],"URL":"https:\/\/doi.org\/10.1007\/s12351-024-00829-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,13]]},"assertion":[{"value":"5 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 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 have no Conflict 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":"21"}}