{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:34:25Z","timestamp":1776976465641,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T00:00:00Z","timestamp":1554768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61663023"],"award-info":[{"award-number":["61663023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10489-019-01457-w","type":"journal-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T09:02:40Z","timestamp":1554800560000},"page":"3362-3382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7336-9699","authenticated-orcid":false,"given":"Fuqing","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Feilong","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weimin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Chuck","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Houbin","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"issue":"2","key":"1457_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166\u2013180","journal-title":"Omega"},{"issue":"3","key":"1457_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.omega.2010.07.004","volume":"39","author":"AJ Ruiz-Torres","year":"2011","unstructured":"Ruiz-Torres AJ, Ho JC, Ablanedo-Rosas JH (2011) Makespan and workstation utilization minimization in a flowshop with operations flexibility. Omega 39(3):273\u2013282","journal-title":"Omega"},{"issue":"2","key":"1457_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"37","author":"DP Ronconi","year":"2009","unstructured":"Ronconi DP, Henriques LRS (2009) Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37(2):272\u2013281","journal-title":"Omega"},{"issue":"5","key":"1457_CR4","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2009.08.001","volume":"37","author":"H Gong","year":"2010","unstructured":"Gong H, Tang L, Duin CW (2010) A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput Oper Res 37(5):960\u2013969","journal-title":"Comput Oper Res"},{"issue":"3","key":"1457_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"issue":"3\u20134","key":"1457_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01324886","volume":"4","author":"SP Sethi","year":"1992","unstructured":"Sethi SP, Sriskandarajah C, Sorger G, Blazewicz J, Kubiak W (1992) Sequencing of parts and robot moves in a robotic cell. Int J Flex Manuf Syst 4(3\u20134):331\u2013358","journal-title":"Int J Flex Manuf Syst"},{"key":"1457_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.cie.2015.04.013","volume":"87","author":"I Ribas","year":"2015","unstructured":"Ribas I, Companys R (2015) Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Comput Ind Eng 87:30\u201339","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1457_CR8","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"ST Mccormick","year":"1989","unstructured":"Mccormick ST, Pinedo M, Wolf B, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper Res 37(6):925\u2013935","journal-title":"Oper Res"},{"key":"1457_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.eswa.2016.05.040","volume":"61","author":"V Fernandez-Viagas","year":"2016","unstructured":"Fernandez-Viagas V, Leisten R, Framinan JM (2016) A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst Appl 61:290\u2013301","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1457_CR10","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.omega.2011.06.002","volume":"40","author":"QK Pan","year":"2011","unstructured":"Pan QK, Wang L (2011) Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 40(2):218\u2013229","journal-title":"Omega"},{"issue":"15\u201316","key":"1457_CR11","doi-asserted-by":"publisher","first-page":"6155","DOI":"10.1016\/j.eswa.2015.03.026","volume":"42","author":"I Ribas","year":"2015","unstructured":"Ribas I, Companys R, Tort-Martorell X (2015) An efficient discrete artificial bee Colony algorithm for the blocking flow shop problem with total flowtime minimization. Expert Syst Appl 42(15\u201316):6155\u20136167","journal-title":"Expert Syst Appl"},{"key":"1457_CR12","unstructured":"Nouha N, Talel L (2015) A particle swarm optimization metaheuristic for the blocking flow shop scheduling problem: Total tardiness minimization. Multi-agent systems and agreement technologies. Springer: 145\u2013153"},{"issue":"C","key":"1457_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2017.02.027","volume":"79","author":"V Riahi","year":"2017","unstructured":"Riahi V, Khorramizadeh M, Newton MAH, Sattar A (2017) Scatter search for mixed blocking flowshop scheduling. Expert Syst Appl 79(C):20\u201332","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1457_CR14","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TASE.2012.2219860","volume":"10","author":"QK Pan","year":"2013","unstructured":"Pan QK, Wang L, Sang HY, Li JQ, Liu M (2013) A high performing memetic algorithm for the Flowshop scheduling problem with blocking. IEEE Trans Auto Sci Eng 10(3):741\u2013756","journal-title":"IEEE Trans Auto Sci Eng"},{"issue":"2","key":"1457_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.omega.2012.03.006","volume":"41","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC (2013) Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41(2):383\u2013389","journal-title":"Omega"},{"issue":"11","key":"1457_CR16","doi-asserted-by":"publisher","first-page":"2880","DOI":"10.1016\/j.cor.2012.02.020","volume":"39","author":"C Wang","year":"2012","unstructured":"Wang C, Song S, Gupta JND, Wu C (2012) A three-phase algorithm for flowshop scheduling with blocking to minimize makespan. Comput Oper Res 39(11):2880\u20132887","journal-title":"Comput Oper Res"},{"issue":"1","key":"1457_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.cie.2011.02.013","volume":"61","author":"L Wang","year":"2011","unstructured":"Wang L, Pan QK, Tasgetiren MF (2011) A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Comput Ind Eng 61(1):76\u201383","journal-title":"Comput Ind Eng"},{"issue":"7","key":"1457_CR18","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1016\/j.cor.2013.02.003","volume":"40","author":"G Moslehi","year":"2013","unstructured":"Moslehi G, Khorasanian D (2013) Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput Oper Res 40(7):1874\u20131883","journal-title":"Comput Oper Res"},{"key":"1457_CR19","unstructured":"Ying KC, Lin SW (2017) Minimizing Makespan in distributed blocking Flowshops using hybrid iterated greedy algorithms. IEEE Access PP (99):1\u20131"},{"issue":"C","key":"1457_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK, Suganthan PN (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77(C):111\u2013126","journal-title":"Comput Oper Res"},{"issue":"22","key":"1457_CR21","doi-asserted-by":"publisher","first-page":"6782","DOI":"10.1080\/00207543.2016.1177671","volume":"54","author":"Y Han","year":"2016","unstructured":"Han Y, Gong D, Li J, Zhang Y (2016) Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm. Int J Prod Res 54(22):6782\u20136797","journal-title":"Int J Prod Res"},{"key":"1457_CR22","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan QK, Kizilay D, Suer G (2015) A populated local search with differential evolution for blocking flowshop scheduling problem. IEEE Congress on Evolutionary Computation (CEC): 2789\u20132796","DOI":"10.1109\/CEC.2015.7257235"},{"issue":"4","key":"1457_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3390\/a9040071","volume":"9","author":"M Tasgetiren","year":"2016","unstructured":"Tasgetiren M, Pan QK, Kizilay D, Gao K (2016) A variable block insertion heuristic for the blocking Flowshop scheduling problem with Total flowtime criterion. Algorithms 9(4):71","journal-title":"Algorithms"},{"key":"1457_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.eswa.2018.06.020","volume":"113","author":"Z Shao","year":"2018","unstructured":"Shao Z, Pi D, Shao W (2018) A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem. Expert Syst Appl 113:77\u201399","journal-title":"Expert Syst Appl"},{"key":"1457_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cie.2017.07.037","volume":"111","author":"Z Shao","year":"2017","unstructured":"Shao Z, Pi D, Shao W (2017) Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Comput Ind Eng 111:331\u2013351","journal-title":"Comput Ind Eng"},{"key":"1457_CR26","doi-asserted-by":"crossref","unstructured":"Nouri N, Ladhari T (2015) Minimizing regular objectives for blocking permutation flow shop scheduling: heuristic approaches. 441\u2013448","DOI":"10.1145\/2739480.2754638"},{"key":"1457_CR27","doi-asserted-by":"crossref","unstructured":"Toumi S, Jarboui B, Eddaly M, Rebai (2013) A solving blocking flowshop scheduling problem with branch and bound algorithm. International Conference on Advanced Logistics and Transport: 411\u2013416","DOI":"10.1109\/ICAdLT.2013.6568494"},{"issue":"4","key":"1457_CR28","first-page":"301","volume":"23","author":"D Khorasanian","year":"2012","unstructured":"Khorasanian D, Moslehi G (2012) An iterated greedy algorithm for solving the blocking flow shop scheduling problem with Total flow time criteria. Int J Indust Eng 23(4):301\u2013308","journal-title":"Int J Indust Eng"},{"key":"1457_CR29","unstructured":"Yang X-S (2018) Mathematical analysis of nature-inspired algorithms. Nature-inspired algorithms and applied optimization. Springer: 1\u201325"},{"key":"1457_CR30","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942\u20131948","journal-title":"IEEE Int Conf Neural Netw"},{"issue":"4","key":"1457_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"key":"1457_CR32","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.eswa.2018.08.012","volume":"115","author":"F Zhao","year":"2019","unstructured":"Zhao F, Qin S, Zhang Y, Ma W, Zhang C, Song H (2019) A two-stage differential biogeography-based optimization algorithm and its performance analysis. Expert Syst Appl 115:329\u2013345","journal-title":"Expert Syst Appl"},{"issue":"21","key":"1457_CR33","doi-asserted-by":"publisher","first-page":"7436","DOI":"10.1016\/j.eswa.2015.05.035","volume":"42","author":"F Zhao","year":"2015","unstructured":"Zhao F, Liu Y, Zhang C, Wang J (2015) A self-adaptive harmony PSO search algorithm and its performance analysis. Expert Syst Appl 42(21):7436\u20137455","journal-title":"Expert Syst Appl"},{"key":"1457_CR34","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.engappai.2017.07.023","volume":"65","author":"F Zhao","year":"2017","unstructured":"Zhao F, Liu Y, Zhang Y, Ma W, Zhang C (2017) A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems. Eng Appl Artif Intell 65:178\u2013199","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"1457_CR35","first-page":"1","volume":"54","author":"F Zhao","year":"2017","unstructured":"Zhao F, Shao Z, Wang J, Zhang C (2017) A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. Int J Prod Res 54(4):1\u201322","journal-title":"Int J Prod Res"},{"key":"1457_CR36","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.knosys.2017.11.015","volume":"141","author":"Z Meng","year":"2018","unstructured":"Meng Z, Pan JS, Kong L (2018) Parameters with adaptive learning mechanism (PALM) for the enhancement of differential evolution. Knowl-Based Syst 141:92\u2013112","journal-title":"Knowl-Based Syst"},{"key":"1457_CR37","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.knosys.2016.06.029","volume":"109","author":"Z Meng","year":"2016","unstructured":"Meng Z, Pan JS, Xu H (2016) QUasi-affine TRansformation evolutionary (QUATRE) algorithm: a cooperative swarm based algorithm for global optimization. Knowl-Based Syst 109:104\u2013121","journal-title":"Knowl-Based Syst"},{"key":"1457_CR38","first-page":"19","volume":"7","author":"RV Rao","year":"2016","unstructured":"Rao RV (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19\u201334","journal-title":"Int J Ind Eng Comput"},{"issue":"13","key":"1457_CR39","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"1457_CR40","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.swevo.2018.02.018","volume":"41","author":"E Rashedi","year":"2018","unstructured":"Rashedi E, Rashedi E, Nezamabadi-pour H (2018) A comprehensive survey on gravitational search algorithm. Swarm Evol Comput 41:141\u2013158","journal-title":"Swarm Evol Comput"},{"key":"1457_CR41","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.eswa.2018.07.008","volume":"113","author":"F Zhao","year":"2018","unstructured":"Zhao F, Xue F, Zhang Y, Ma W, Zhang C, Song H (2018) A hybrid algorithm based on self-adaptive gravitational search algorithm and differential evolution. Expert Syst Appl 113:515\u2013530","journal-title":"Expert Syst Appl"},{"key":"1457_CR42","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.future.2018.01.005","volume":"83","author":"A Choudhary","year":"2018","unstructured":"Choudhary A, Gupta I, Singh V, Jana PK (2018) A GSA based hybrid algorithm for bi-objective workflow scheduling in cloud computing. Futur Gener Comput Syst 83:14\u201326","journal-title":"Futur Gener Comput Syst"},{"key":"1457_CR43","doi-asserted-by":"crossref","unstructured":"Lee T, Loong Y, Moslemipour (2017) G gravitational search algorithm optimization for bi-objective flow shop scheduling using weighted dispatching rules. 2017 7th IEEE International Conference on Control System, Computing and Engineering (ICCSCE) IEEE: 127\u2013132","DOI":"10.1109\/ICCSCE.2017.8284392"},{"issue":"2","key":"1457_CR44","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00521-016-2693-x","volume":"30","author":"N Narang","year":"2018","unstructured":"Narang N (2018) Hydro-thermal generation scheduling using integrated gravitational search algorithm and predator\u2013prey optimization technique. Neural Comput & Applic 30(2):519\u2013538","journal-title":"Neural Comput & Applic"},{"key":"1457_CR45","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.energy.2018.04.172","volume":"155","author":"S \u00d6zy\u00f6n","year":"2018","unstructured":"\u00d6zy\u00f6n S, Ya\u015far C (2018) Gravitational search algorithm applied to fixed head hydrothermal power system with transmission line security constraints. Energy 155:392\u2013407","journal-title":"Energy"},{"key":"1457_CR46","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.eswa.2018.02.026","volume":"102","author":"D Pelusi","year":"2018","unstructured":"Pelusi D, Mascella R, Tallini L, Nayak J, Naik B, Abraham A (2018) Neural network and fuzzy system for the tuning of gravitational search algorithm parameters. Expert Syst Appl 102:234\u2013244","journal-title":"Expert Syst Appl"},{"key":"1457_CR47","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.engappai.2018.03.001","volume":"71","author":"H Mittal","year":"2018","unstructured":"Mittal H, Saraswat M (2018) An optimum multi-level image thresholding segmentation using non-local means 2D histogram and exponential Kbest gravitational search algorithm. Eng Appl Artif Intell 71:226\u2013235","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"1457_CR48","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1457_CR49","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":"1","key":"1457_CR50","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2006.11.003","volume":"37","author":"X Li","year":"2009","unstructured":"Li X, Wang Q, Wu C (2009) Efficient composite heuristics for total flowtime minimization in permutation flow shops. Omega 37(1):155\u2013164","journal-title":"Omega"},{"issue":"1\u20134","key":"1457_CR51","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00170-012-4493-5","volume":"67","author":"Y-Y Han","year":"2013","unstructured":"Han Y-Y, Quan-Ke L, Qing J, Cao NN, Liang JJ (2013) Effective hybrid discrete artificial bee colony algorithms for the total;flowtime minimization in the blocking flowshop problem. Int J Adv Manuf Technol 67(1\u20134):397\u2013414","journal-title":"Int J Adv Manuf Technol"},{"issue":"8","key":"1457_CR52","doi-asserted-by":"publisher","first-page":"2621","DOI":"10.1016\/j.camwa.2012.06.026","volume":"64","author":"B Wu","year":"2012","unstructured":"Wu B, Qian C, Ni W, Fan S (2012) Hybrid harmony search and artificial bee colony algorithm for global optimization problems. Comput Math Applic 64(8):2621\u20132634","journal-title":"Comput Math Applic"},{"issue":"1","key":"1457_CR53","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Jr EEE, Ham I (1983) A heuristic algorithm for the m -machine, n -job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"2","key":"1457_CR54","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput J 12(2):652\u2013662","journal-title":"Appl Soft Comput J"},{"key":"1457_CR55","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1998) Tabu search. Handbook of combinatorial optimization. Springer: 2093\u20132229","DOI":"10.1007\/978-1-4613-0303-9_33"},{"issue":"11","key":"1457_CR56","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. \n                    https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput Oper Res"},{"key":"1457_CR57","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.eswa.2017.01.006","volume":"74","author":"I Ribas","year":"2017","unstructured":"Ribas I, Companys R, Tort-Martorell X (2017) Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst Appl 74:41\u201354","journal-title":"Expert Syst Appl"},{"key":"1457_CR58","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","volume":"91","author":"F Zhao","year":"2018","unstructured":"Zhao F, Liu H, Zhang Y, Ma W, Zhang C (2018) A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Expert Syst Appl 91:347\u2013363","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1457_CR59","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"key":"1457_CR60","unstructured":"Goryajnov VV (1996) Evolutionary families of analytic functions and time-nonhomogeneous Markov branching processes. Dokl Math 53 (2)"},{"key":"1457_CR61","doi-asserted-by":"crossref","unstructured":"Sudholt D (2010) General lower bounds for the running time of evolutionary algorithms. International conference on parallel problem solving from nature. Springer: 124\u2013133","DOI":"10.1007\/978-3-642-15844-5_13"},{"issue":"1","key":"1457_CR62","first-page":"158","volume":"48","author":"DC Montgomery","year":"2006","unstructured":"Montgomery DC (2006) Design and analysis of experiments. Technometrics 48(1):158\u2013158","journal-title":"Technometrics"},{"key":"1457_CR63","doi-asserted-by":"publisher","first-page":"124","DOI":"10.4028\/www.scientific.net\/JERA.36.124","volume":"36","author":"G Lebbar","year":"2018","unstructured":"Lebbar G, Barkany AE, Jabri A, Abbassi IE (2018) Hybrid metaheuristics for solving the blocking Flowshop scheduling problem. Int J Eng Res Afr 36:124\u2013136","journal-title":"Int J Eng Res Afr"},{"key":"1457_CR64","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"G Zhang","year":"2018","unstructured":"Zhang G, Xing K, Cao F (2018) Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion. Eng Appl Artif Intell 76:96\u2013107","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"1457_CR65","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"D Molina","year":"2009","unstructured":"Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01457-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-019-01457-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01457-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T23:14:15Z","timestamp":1586301255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-019-01457-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,9]]},"references-count":65,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1457"],"URL":"https:\/\/doi.org\/10.1007\/s10489-019-01457-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,9]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}