{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:27:45Z","timestamp":1771126065614,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2018YFB1700600"],"award-info":[{"award-number":["2018YFB1700600"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671131"],"award-info":[{"award-number":["71671131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2019CFB487"],"award-info":[{"award-number":["2019CFB487"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12293-021-00329-6","type":"journal-article","created":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T05:02:48Z","timestamp":1619154168000},"page":"185-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Integrated production and distribution scheduling in distributed hybrid flow shops"],"prefix":"10.1007","volume":"13","author":[{"given":"Hu","family":"Qin","sequence":"first","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Teng","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,23]]},"reference":[{"issue":"1","key":"329_CR1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.ejor.2014.03.039","volume":"238","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Aloulou MA, Fu LL (2014) Coordination of production and interstage batch delivery with outsourced distribution. Eur J Oper Res 238(1):130\u2013142","journal-title":"Eur J Oper Res"},{"issue":"1","key":"329_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-019-00294-1","volume":"12","author":"JE Amaya","year":"2020","unstructured":"Amaya JE, Cotta C, Fern\u00e1ndez-Leiva AJ, Garc\u00eda-S\u00e1nchez P (2020) Deep memetic models for combinatorial optimization problems: application to the tool switching problem. Memet Comput 12(1):3\u201322","journal-title":"Memet Comput"},{"issue":"12","key":"329_CR3","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1016\/j.cor.2010.03.010","volume":"37","author":"JF Bard","year":"2010","unstructured":"Bard JF, Nananukul N (2010) A branch-and-price algorithm for an integrated production and inventory routing problem. Comput Oper Res 37(12):2202\u20132217","journal-title":"Comput Oper Res"},{"key":"329_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2018.09.035","volume":"126","author":"SA Basir","year":"2018","unstructured":"Basir SA, Mazdeh MM, Namakshenas M (2018) Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system. Comput Ind Eng 126:217\u2013231","journal-title":"Comput Ind Eng"},{"issue":"1","key":"329_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10845-014-0890-y","volume":"27","author":"J Behnamian","year":"2016","unstructured":"Behnamian J, Ghomi SF (2016) A survey of multi-factory scheduling. J Intell Manuf 27(1):231\u2013249","journal-title":"J Intell Manuf"},{"key":"329_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","volume":"103","author":"G Bektur","year":"2019","unstructured":"Bektur G, Sara\u00e7 T (2019) A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput Oper Res 103:46\u201363","journal-title":"Comput Oper Res"},{"issue":"5","key":"329_CR7","first-page":"2469","volume":"13","author":"X Cai","year":"2019","unstructured":"Cai X, Sun Y, Cui Z, Zhang W, Chen J (2019) Optimal LEACH protocol with improved bat algorithm in wireless sensor networks. KSII Trans Internet Inf Syst 13(5):2469\u20132490","journal-title":"KSII Trans Internet Inf Syst"},{"issue":"11","key":"329_CR8","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1007\/s13042-019-01002-8","volume":"10","author":"X Cai","year":"2019","unstructured":"Cai X, Zhang J, Liang H, Wang L, Wu Q (2019) An ensemble bat algorithm for large-scale optimization. Int J Mach Learn Cybern 10(11):3099\u20133113","journal-title":"Int J Mach Learn Cybern"},{"issue":"13","key":"329_CR9","doi-asserted-by":"crossref","first-page":"4070","DOI":"10.1080\/00207543.2013.774476","volume":"51","author":"YC Chang","year":"2013","unstructured":"Chang YC, Chang KH, Chang TK (2013) Applied column generation-based approach to solve supply chain scheduling problems. Int J Prod Res 51(13):4070\u20134086","journal-title":"Int J Prod Res"},{"issue":"13","key":"329_CR10","doi-asserted-by":"crossref","first-page":"2939","DOI":"10.1080\/002075499190365","volume":"37","author":"SJ Chen","year":"1999","unstructured":"Chen SJ, Lin LI (1999) Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule. Int J Prod Res 37(13):2939\u20132956","journal-title":"Int J Prod Res"},{"issue":"4","key":"329_CR11","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen ZL, Vairaktarakis GL (2005) Integrated scheduling of production and distribution operations. Manag Sci 51(4):614\u2013628","journal-title":"Manag Sci"},{"issue":"1","key":"329_CR12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130\u2013148","journal-title":"Oper Res"},{"issue":"6","key":"329_CR13","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1002\/nav.21641","volume":"62","author":"BY Cheng","year":"2015","unstructured":"Cheng BY, Leung JT, Li K, Yang SL (2015) Single batch machine scheduling with deliveries. Nav Res Logist 62(6):470\u2013482","journal-title":"Nav Res Logist"},{"key":"329_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2015.02.017","volume":"83","author":"BY Cheng","year":"2015","unstructured":"Cheng BY, Leung JYT, Li K (2015) Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method. Comput Ind Eng 83:217\u2013225","journal-title":"Comput Ind Eng"},{"issue":"4","key":"329_CR15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s12293-020-00311-8","volume":"12","author":"T Cheng","year":"2020","unstructured":"Cheng T, Zhong J (2020) An efficient memetic genetic programming framework for symbolic regression. Memet Comput 12(4):299\u2013315","journal-title":"Memet Comput"},{"issue":"2","key":"329_CR16","doi-asserted-by":"crossref","first-page":"3857","DOI":"10.1016\/j.eswa.2008.02.040","volume":"36","author":"FD Chou","year":"2009","unstructured":"Chou FD (2009) An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem. Expert Syst Appl 36(2):3857\u20133865","journal-title":"Expert Syst Appl"},{"issue":"3","key":"329_CR17","doi-asserted-by":"crossref","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":"329_CR18","first-page":"521","volume":"4","author":"O Engin","year":"2011","unstructured":"Engin O, G\u00fcnaydin C (2011) An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan. Int J Comput Intell Syst 4(4):521\u2013529","journal-title":"Int J Comput Intell Syst"},{"key":"329_CR19","doi-asserted-by":"crossref","first-page":"120824","DOI":"10.1016\/j.jclepro.2020.120824","volume":"259","author":"M Ganji","year":"2020","unstructured":"Ganji M, Kazemipoor H, Molana SMH, Sajadi SM (2020) A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows. J Clean Prod 259:120824","journal-title":"J Clean Prod"},{"key":"329_CR20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ijpe.2014.08.017","volume":"160","author":"S Gao","year":"2015","unstructured":"Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13\u201325","journal-title":"Int J Prod Econ"},{"key":"329_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.asoc.2016.01.052","volume":"42","author":"Z Guo","year":"2016","unstructured":"Guo Z, Zhang D, Leung SYS, Shi L (2016) A bi-level evolutionary optimization approach for integrated production and transportation scheduling. Appl Soft Comput 42:215\u2013228","journal-title":"Appl Soft Comput"},{"key":"329_CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.omega.2015.10.012","volume":"66","author":"Z Guo","year":"2017","unstructured":"Guo Z, Shi L, Chen L, Liang Y (2017) A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing. Omega 66:327\u2013343","journal-title":"Omega"},{"issue":"4","key":"329_CR23","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51(4):566\u2013584","journal-title":"Oper Res"},{"key":"329_CR24","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.asoc.2016.08.019","volume":"49","author":"A Hassanzadeh","year":"2016","unstructured":"Hassanzadeh A, Rasti-Barzoki M, Khosroshahi H (2016) Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl Soft Comput 49:335\u2013351","journal-title":"Appl Soft Comput"},{"key":"329_CR25","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cie.2018.08.024","volume":"125","author":"TY Hong","year":"2018","unstructured":"Hong TY, Chien CF, Wang HK, Guo HZ (2018) A two-phase decoding genetic algorithm for TFT-LCD array photolithography stage scheduling problem with constrained waiting time. Comput Ind Eng 125:200\u2013211","journal-title":"Comput Ind Eng"},{"key":"329_CR26","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.cie.2017.01.010","volume":"113","author":"X Liu","year":"2017","unstructured":"Liu X, Chung TP (2017) An outsourcing-scheduling problem in a two-stage supply chain via improved immunoglobulin-based artificial immune system. Comput Ind Eng 113:819\u2013830","journal-title":"Comput Ind Eng"},{"issue":"17","key":"329_CR27","doi-asserted-by":"crossref","first-page":"5758","DOI":"10.1080\/00207543.2017.1418986","volume":"56","author":"X Liu","year":"2018","unstructured":"Liu X, Lu S, Pei J, Pardalos PM (2018) A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. Int J Prod Res 56(17):5758\u20135775","journal-title":"Int J Prod Res"},{"key":"329_CR28","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1821927","author":"H Liu","year":"2020","unstructured":"Liu H, Guo Z, Zhang Z (2020) A hybrid multi-level optimisation framework for integrated production scheduling and vehicle routing with flexible departure time. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2020.1821927","journal-title":"Int J Prod Res"},{"key":"329_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.jmsy.2016.06.005","volume":"40","author":"N Jamili","year":"2016","unstructured":"Jamili N, Ranjbar M, Salari M (2016) A bi-objective model for integrated scheduling of production and distribution in a supply chain with order release date restrictions. J Manuf Syst 40:105\u2013118","journal-title":"J Manuf Syst"},{"key":"329_CR30","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi H, Mazdeh MM, Rostami M (2017) The two stage assembly flow-shop scheduling problem with batching and delivery. Eng Appl Artif Intell 63:98\u2013107","journal-title":"Eng Appl Artif Intell"},{"key":"329_CR31","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1080\/00207543.2018.1481301","volume":"57","author":"F Marandi","year":"2018","unstructured":"Marandi F, Fatemi Ghomi SMT (2018) Integrated multi-factory production and distribution scheduling applying vehicle routing approach. Int J Prod Res 57:722\u2013748","journal-title":"Int J Prod Res"},{"issue":"4","key":"329_CR32","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.cor.2006.07.006","volume":"35","author":"MM Mazdeh","year":"2008","unstructured":"Mazdeh MM, Sarhadi M, Hindi KS (2008) A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Comput Oper Res 35(4):1099\u20131111","journal-title":"Comput Oper Res"},{"key":"329_CR33","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.cie.2016.12.010","volume":"104","author":"S Moons","year":"2017","unstructured":"Moons S, Ramaekers K, Caris A, Arda Y (2017) Integrating production scheduling and vehicle routing decisions at the operational decision level: a review and discussion. Comput Ind Eng 104:224\u2013245","journal-title":"Comput Ind Eng"},{"key":"329_CR34","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ins.2014.12.053","volume":"302","author":"H Mujtaba","year":"2015","unstructured":"Mujtaba H, Kendall G, Baig AR, \u00d6zcan E (2015) Detecting change and dealing with uncertainty in imperfect evolutionary environments. Inf Sci 302:33\u201349","journal-title":"Inf Sci"},{"issue":"4","key":"329_CR35","doi-asserted-by":"crossref","first-page":"3252","DOI":"10.1016\/j.eswa.2010.08.111","volume":"38","author":"QK Pan","year":"2011","unstructured":"Pan QK, Suganthan PN, Liang JJ, Tasgetiren MF (2011) A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst Appl 38(4):3252\u20133259","journal-title":"Expert Syst Appl"},{"key":"329_CR36","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Wang L, Liang J, Li XY (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"issue":"6","key":"329_CR37","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28(6):1436\u20131441","journal-title":"Oper Res"},{"issue":"6","key":"329_CR38","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/nav.20100","volume":"52","author":"G Pundoor","year":"2005","unstructured":"Pundoor G, Chen ZL (2005) Scheduling a production\u2013distribution system to optimize the tradeoff between delivery tardiness and distribution cost. Nav Res Logist 52(6):571\u2013589","journal-title":"Nav Res Logist"},{"issue":"8","key":"329_CR39","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Frami\u00f1an JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439\u20131454","journal-title":"Comput Oper Res"},{"issue":"16","key":"329_CR40","doi-asserted-by":"crossref","first-page":"4909","DOI":"10.1016\/j.apm.2015.03.052","volume":"39","author":"M Rostami","year":"2015","unstructured":"Rostami M, Kheirandish O, Ansari N (2015) Minimizing maximum tardiness and delivery costs with batch delivery and job release times. Appl Math Model 39(16):4909\u20134927","journal-title":"Appl Math Model"},{"issue":"1","key":"329_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"329_CR42","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ijpe.2013.08.015","volume":"147","author":"E Selvarajah","year":"2014","unstructured":"Selvarajah E, Zhang R (2014) Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs. Int J Prod Econ 147:117\u2013124","journal-title":"Int J Prod Econ"},{"issue":"8","key":"329_CR43","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1002\/nav.20116","volume":"52","author":"H Wang","year":"2005","unstructured":"Wang H, Lee CY (2005) Production and transport logistics scheduling with two transport mode choices. Nav Res Logist 52(8):796\u2013809","journal-title":"Nav Res Logist"},{"issue":"24","key":"329_CR44","doi-asserted-by":"crossref","first-page":"7360","DOI":"10.1080\/00207543.2014.930535","volume":"52","author":"K Wang","year":"2014","unstructured":"Wang K, Choi SH, Qin H (2014) An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times. Int J Prod Res 52(24):7360\u20137376","journal-title":"Int J Prod Res"},{"key":"329_CR45","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.cie.2015.09.007","volume":"90","author":"K Wang","year":"2015","unstructured":"Wang K, Choi SH, Lu H (2015) A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop. Comput Ind Eng 90:186\u2013196","journal-title":"Comput Ind Eng"},{"issue":"22","key":"329_CR46","doi-asserted-by":"crossref","first-page":"6891","DOI":"10.1080\/00207543.2016.1193246","volume":"54","author":"K Wang","year":"2016","unstructured":"Wang K, Ma WQ, Luo H, Qin H (2016) Coordinated scheduling of production and transportation in a two-stage assembly flowshop. Int J Prod Res 54(22):6891\u20136911","journal-title":"Int J Prod Res"},{"issue":"10","key":"329_CR47","doi-asserted-by":"crossref","first-page":"1826","DOI":"10.1109\/TSMC.2017.2720178","volume":"48","author":"K Wang","year":"2018","unstructured":"Wang K, Luo H, Liu F, Yue X (2018) Permutation flow shop scheduling with batch delivery to multiple customers in supply chains. IEEE Trans Syst Man Cybern Syst 48(10):1826\u20131837","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"329_CR48","doi-asserted-by":"crossref","first-page":"102350","DOI":"10.1016\/j.omega.2020.102350","volume":"102","author":"K Wang","year":"2021","unstructured":"Wang K, Qin H, Huang Y, Luo M, Zhou L (2021) Surgery scheduling in outpatient procedure centre with re-entrant patient flow and fuzzy service times. Omega 102:102350","journal-title":"Omega"},{"key":"329_CR49","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1016\/j.asoc.2018.07.051","volume":"71","author":"L Wang","year":"2018","unstructured":"Wang L, Pei J, Wen Y, Pi J, Fei M, Pardalos PM (2018) An improved adaptive human learning algorithm for engineering optimization. Appl Soft Comput 71:894\u2013904","journal-title":"Appl Soft Comput"},{"issue":"1","key":"329_CR50","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s12293-019-00279-0","volume":"12","author":"L Deng","year":"2020","unstructured":"Deng L, Zhang L, Sun H, Qiao L (2020) DSM-DE: a differential evolution with dynamic speciation-based mutation for single-objective optimization. Memet Comput 12(1):73\u201386","journal-title":"Memet Comput"},{"key":"329_CR51","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","volume":"82","author":"X Wu","year":"2019","unstructured":"Wu X, Che A (2019) A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82:155\u2013165","journal-title":"Omega"},{"key":"329_CR52","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1757174","author":"S Yang","year":"2020","unstructured":"Yang S, Xu Z (2020) The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2020.1757174","journal-title":"Int J Prod Res"},{"key":"329_CR53","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.cie.2014.12.023","volume":"81","author":"M Yazdani","year":"2015","unstructured":"Yazdani M, Gohari S, Naderi B (2015) Multi-factory parallel machine problems: improved mathematical models and artificial bee colony algorithm. Comput Ind Eng 81:36\u201345","journal-title":"Comput Ind Eng"},{"key":"329_CR54","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl 92:132\u2013141","journal-title":"Expert Syst Appl"},{"key":"329_CR55","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.cie.2017.10.018","volume":"114","author":"OF Yilmaz","year":"2017","unstructured":"Yilmaz OF, Pardalos PM (2017) Minimizing average lead time for the coordinated scheduling problem in a two-stage supply chain with multiple customers and multiple manufacturers. Comput Ind Eng 114:244\u2013257","journal-title":"Comput Ind Eng"},{"key":"329_CR56","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"C Yu","year":"2018","unstructured":"Yu C, Semeraro Q, Matta A (2018) A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput Oper Res 100:211\u2013229","journal-title":"Comput Oper Res"},{"issue":"7","key":"329_CR57","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1016\/j.cor.2011.07.019","volume":"39","author":"Z Zhang","year":"2012","unstructured":"Zhang Z, Zheng L, Li N, Wang W, Zhong S, Hu K (2012) Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning. Comput Oper Res 39(7):1315\u20131324","journal-title":"Comput Oper Res"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-021-00329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-021-00329-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-021-00329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T08:45:48Z","timestamp":1622709948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-021-00329-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,23]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["329"],"URL":"https:\/\/doi.org\/10.1007\/s12293-021-00329-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,23]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}