{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T03:13:40Z","timestamp":1764731620995,"version":"3.37.3"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"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"}]},{"DOI":"10.13039\/501100005229","name":"Foundation of Gansu Province","doi-asserted-by":"publisher","award":["2017GS10817"],"award-info":[{"award-number":["2017GS10817"]}],"id":[{"id":"10.13039\/501100005229","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008536","name":"Lanzhou Science Bureau project","doi-asserted-by":"publisher","award":["2018-rc-98"],"award-info":[{"award-number":["2018-rc-98"]}],"id":[{"id":"10.13039\/501100008536","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wenzhou Public Welfare Science and Technology","award":["G20170016"],"award-info":[{"award-number":["G20170016"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.eswa.2019.02.023","type":"journal-article","created":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T20:58:32Z","timestamp":1550523512000},"page":"321-339","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":81,"special_numbering":"C","title":["A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem"],"prefix":"10.1016","volume":"126","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7336-9699","authenticated-orcid":false,"given":"Fuqing","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Shuo","family":"Qin","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":"78","reference":[{"key":"10.1016\/j.eswa.2019.02.023_bib0001","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s00521-016-2559-2","article-title":"Training radial basis function networks using biogeography-based optimizer","volume":"29","author":"Aljarah","year":"2018","journal-title":"Neural Computing & Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0002","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1057\/jors.1976.176","article-title":"Solutions to the constrained flowshop sequencing problem","volume":"27","author":"Bonney","year":"1976","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2019.02.023_bib0003","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-7152(85)90063-X","article-title":"Pointwise properties of convergence in probability","volume":"3","year":"1985","journal-title":"Statistics & Probability Letters"},{"key":"10.1016\/j.eswa.2019.02.023_bib0004","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","article-title":"The particle swarm \u2013 Explosion, stability, and convergence in a multidimensional complex space","volume":"6","author":"Clerc","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.eswa.2019.02.023_bib0005","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","article-title":"An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem","volume":"30","author":"Ding","year":"2015","journal-title":"Applied Soft Computing"},{"year":"2015","series-title":"A novel block-shifting simulated annealing algorithm for the no-wait flowshop scheduling problem","author":"Ding","key":"10.1016\/j.eswa.2019.02.023_bib0006"},{"key":"10.1016\/j.eswa.2019.02.023_bib0007","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.eswa.2015.09.011","article-title":"A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs","volume":"44","author":"Ferrer","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0008","doi-asserted-by":"crossref","first-page":"6479","DOI":"10.1080\/00207540701418960","article-title":"Total tardiness minimization in permutation flow shops: A simple approach based on a variable greedy algorithm","volume":"46","author":"Framinan","year":"2008","journal-title":"International Journal of Production Research"},{"year":"2012","series-title":"A composite heuristic for the no-wait flow shop scheduling","author":"Gao","key":"10.1016\/j.eswa.2019.02.023_bib0009"},{"key":"10.1016\/j.eswa.2019.02.023_bib0010","first-page":"592","article-title":"Discrete harmony search algorithm for the no wait flow shop scheduling problem with makespan criterion","volume":"6838","author":"Gao","year":"2011"},{"year":"1979","series-title":"Computers and intractability: A guide to the theory of NP-Completeness","author":"Garey","key":"10.1016\/j.eswa.2019.02.023_bib0011"},{"key":"10.1016\/j.eswa.2019.02.023_bib0012","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm: Harmony search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"year":"1997","series-title":"Variable neighborhood search","author":"Hansen","key":"10.1016\/j.eswa.2019.02.023_bib0013"},{"key":"10.1016\/j.eswa.2019.02.023_bib0014","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1134\/S1990478913010067","article-title":"The variable neighborhood search for the two machine flow shop problem with a passive prefetch","volume":"7","author":"Kononova","year":"2013","journal-title":"Journal of Applied and Industrial Mathematics"},{"key":"10.1016\/j.eswa.2019.02.023_bib0015","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.cie.2014.11.024","article-title":"Variable neighborhood search for two-agent flow shop scheduling problem","volume":"80","author":"Lei","year":"2015","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.eswa.2019.02.023_bib0016","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEM.2017.2774281","article-title":"A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop","volume":"65","author":"Lei","year":"2018","journal-title":"IEEE Transactions on Engineering Management"},{"key":"10.1016\/j.eswa.2019.02.023_bib0017","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/00207540903536130","article-title":"Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines","volume":"49","author":"Lei","year":"2011","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0018","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.knosys.2015.01.017","article-title":"A hybrid biogeography-based optimization for the fuzzy flexible job-shop scheduling problem","volume":"78","author":"Lin","year":"2015","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.eswa.2019.02.023_bib0019","doi-asserted-by":"crossref","first-page":"4805","DOI":"10.1080\/00207543.2015.1094584","article-title":"A hybrid discrete biogeography-based optimization for the permutation flowshop scheduling problem","volume":"54","author":"Lin","year":"2016","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0020","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.omega.2015.12.002","article-title":"Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics","volume":"64","author":"Lin","year":"2016","journal-title":"Omega"},{"key":"10.1016\/j.eswa.2019.02.023_bib0021","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1049\/cje.2018.01.007","article-title":"An improved biogeography-based optimization algorithm for blocking flow shop scheduling problem","volume":"27","author":"Liu","year":"2018","journal-title":"Chinese Journal of Electronics"},{"key":"10.1016\/j.eswa.2019.02.023_bib0022","doi-asserted-by":"crossref","first-page":"3444","DOI":"10.1016\/j.ins.2010.05.035","article-title":"An analysis of the equilibrium of migration models for biogeography-based optimization","volume":"180","author":"Ma","year":"2010","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2019.02.023_bib0023","first-page":"1","article-title":"On the convergence of biogeography-based optimization for binary problems","volume":"11","author":"Ma","year":"2014","journal-title":"Mathematical Problems in Engineering"},{"year":"1976","series-title":"Design and analysis of experiments","author":"Montgomery","key":"10.1016\/j.eswa.2019.02.023_bib0024"},{"key":"10.1016\/j.eswa.2019.02.023_bib0025","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","article-title":"A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion","volume":"52","author":"Moslehi","year":"2014","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0026","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m -machine, n -job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/j.eswa.2019.02.023_bib0027","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","article-title":"A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem","volume":"35","author":"Pan","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0028","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","article-title":"An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion","volume":"38","author":"Pan","year":"2008","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.eswa.2019.02.023_bib0029","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1016\/j.cor.2010.01.002","article-title":"Setting a common due date in a constrained flowshop: A variable neighbourhood search approach","volume":"37","author":"Perez-Gonzalez","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0030","first-page":"1","article-title":"Solutions to no-wait flow shop scheduling problem using the flower pollination algorithm based on the hormone modulation mechanism","volume":"18","author":"Qu","year":"2018","journal-title":"Complexity"},{"key":"10.1016\/j.eswa.2019.02.023_bib0031","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1080\/0951192X.2015.1130256","article-title":"A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness","volume":"29","author":"Rabiee","year":"2016","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"10.1016\/j.eswa.2019.02.023_bib0032","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","article-title":"A no-wait flowshop scheduling heuristic to minimize makespan","volume":"45","author":"Rajendran","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2019.02.023_bib0033","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","article-title":"GSA: A gravitational search algorithm","volume":"179","author":"Rashedi","year":"2009","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2019.02.023_bib0034","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.eswa.2017.02.027","article-title":"Scatter search for mixed blocking flowshop scheduling","volume":"79","author":"Riahi","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0035","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cor.2018.10.003","article-title":"Constraint guided accelerated search for mixed blocking permutation flowshop scheduling","volume":"102","author":"Riahi","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0036","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1504\/EJIE.2013.058392","article-title":"A competitive variable neighbourhood search algorithm for the blocking flow shop problem","volume":"7","author":"Ribas","year":"2013","journal-title":"European Journal of Industrial Engineering"},{"key":"10.1016\/j.eswa.2019.02.023_bib0037","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.eswa.2017.01.006","article-title":"Efficient heuristics for the parallel blocking flow shop scheduling problem","volume":"74","author":"Ribas","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0038","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.asoc.2017.08.020","article-title":"An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem","volume":"61","author":"Shao","year":"2017","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2019.02.023_bib0039","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","article-title":"Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms","volume":"137","author":"Shao","year":"2017","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.eswa.2019.02.023_bib0040","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.cor.2018.02.003","article-title":"A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion","volume":"94","author":"Shao","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0041","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","article-title":"Biogeography-based optimization","volume":"12","author":"Simon","year":"2008","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.eswa.2019.02.023_bib0042","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0043","article-title":"A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem","volume":"8297","author":"Tasgetiren","year":"2013"},{"key":"10.1016\/j.eswa.2019.02.023_bib0044","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","article-title":"New hard benchmark for flowshop scheduling problems minimising makespan","volume":"240","author":"Vallada","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0045","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0046","doi-asserted-by":"crossref","first-page":"68686","DOI":"10.1109\/ACCESS.2018.2879600","article-title":"Multi-objective parallel variable neighborhood search for energy consumption scheduling in blocking flow shops","volume":"6","author":"Wang","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.eswa.2019.02.023_bib0047","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.cie.2014.04.006","article-title":"A hybrid biogeography-based optimization algorithm for job shop scheduling problem","volume":"73","author":"Wang","year":"2014","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.eswa.2019.02.023_bib0048","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2010.02.014","article-title":"Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion","volume":"206","author":"Wang","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0049","first-page":"57","article-title":"Minimizing total flow time in a flow shop with blocking using a hybrid variable neighborhood search and simulated annealing algorithm","volume":"631","author":"Xie","year":"2014"},{"key":"10.1016\/j.eswa.2019.02.023_bib0050","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.jmsy.2017.04.007","article-title":"An improved heuristic for no-wait flow shop to minimize makespan","volume":"44","author":"Ye","year":"2017","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.eswa.2019.02.023_bib0051","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jmsy.2016.05.001","article-title":"An effective heuristic for no-wait flow shop production to minimize makespan","volume":"40","author":"Ye","year":"2016","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.eswa.2019.02.023_bib0052","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.eswa.2016.10.035","article-title":"A new hybrid PSO assisted biogeography-based optimization for emotion and stress recognition from speech signal","volume":"69","author":"Yogesh","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0053","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.engappai.2017.07.023","article-title":"A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems","volume":"65","author":"Zhao","year":"2017","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.eswa.2019.02.023_bib0054","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","article-title":"A discrete water wave optimization algorithm for no-wait flow shop scheduling problem","volume":"91","author":"Zhao","year":"2018","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0055","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.eswa.2018.08.012","article-title":"A two-stage differential biogeography-based optimization algorithm and its performance analysis","volume":"115","author":"Zhao","year":"2019","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2019.02.023_bib0056","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2014.10.008","article-title":"Water wave optimization: A new nature-inspired metaheuristic","volume":"55","author":"Zheng","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2019.02.023_bib0057","first-page":"540","article-title":"Optimization of flow shop scheduling problem using differential evolution and variable neighborhood search","volume":"590","author":"Zhou","year":"2012"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417419301289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417419301289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:42:20Z","timestamp":1565185340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417419301289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":57,"alternative-id":["S0957417419301289"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2019.02.023","relation":{},"ISSN":["0957-4174"],"issn-type":[{"type":"print","value":"0957-4174"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2019.02.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}