{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T02:35:13Z","timestamp":1722738913200},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T00:00:00Z","timestamp":1537401600000},"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":["61572036"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009558","name":"University Natural Science Research Project of Anhui Province","doi-asserted-by":"crossref","award":["KJ2016A272"],"id":[{"id":"10.13039\/501100009558","id-type":"DOI","asserted-by":"crossref"}]},{"name":"University Natural Science Foundation Project of Anhui Province","award":["1808085QF191"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10489-018-1285-0","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T08:16:38Z","timestamp":1537431398000},"page":"791-803","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling"],"prefix":"10.1007","volume":"49","author":[{"given":"Haihong","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Xuemei","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Fulong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]},{"given":"Linfeng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ziyang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"key":"1285_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1287\/opre.20.3.689","volume":"20","author":"DA Wismer","year":"1972","unstructured":"Wismer DA (1972) Solution of the flowshop-scheduling problem with no intermediate queues. Oper Res 20:689\u2013697","journal-title":"Oper Res"},{"key":"1285_CR2","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:510\u2013525","journal-title":"Oper Res"},{"key":"1285_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C Rajendran","year":"1994","unstructured":"Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472\u2013478","journal-title":"J Oper Res Soc"},{"key":"1285_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12:655\u2013679","journal-title":"Oper Res"},{"key":"1285_CR5","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/S0305-0548(98)00087-2","volume":"26","author":"TC Edwin Cheng","year":"1999","unstructured":"Edwin Cheng TC, Wang G, Sriskandarajah C (1999) One-operatorCtwo-machine flowshop scheduling with setup and dismounting times. Comput Oper Res 26:715\u2013730","journal-title":"Comput Oper Res"},{"key":"1285_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.omega.2004.01.004","volume":"32","author":"T Aldowaisan","year":"2004","unstructured":"Aldowaisan T, Allahverdi A (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32:345\u2013352","journal-title":"Omega"},{"key":"1285_CR7","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.neucom.2007.11.017","volume":"72","author":"P Li","year":"2008","unstructured":"Li P, Li S (2008) Quantum-inspired evolutionary algorithm for continuous space optimization based on Bloch coordinates of qubits. Neurocomputing 72:581\u2013591","journal-title":"Neurocomputing"},{"key":"1285_CR8","doi-asserted-by":"publisher","first-page":"5717","DOI":"10.1080\/00207540802070942","volume":"47","author":"R Ruiz","year":"2009","unstructured":"Ruiz R, Allahverdi A (2009) New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. Int J Prod Res 47:5717\u20135738","journal-title":"Int J Prod Res"},{"key":"1285_CR9","doi-asserted-by":"publisher","first-page":"7428","DOI":"10.1080\/00207543.2011.652747","volume":"50","author":"M Rabiee","year":"2012","unstructured":"Rabiee M, Zandieh M, Jafarian A (2012) Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics. Int J Prod Res 50:7428\u20137446","journal-title":"Int J Prod Res"},{"key":"1285_CR10","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10845-013-0830-2","volume":"26","author":"P Ramezani","year":"2015","unstructured":"Ramezani P, Rabiee M, Jolai F (2015) No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach. J Intell Manuf 26:731\u2013744","journal-title":"J Intell Manuf"},{"key":"1285_CR11","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53:1143\u20131167","journal-title":"Int J Prod Res"},{"key":"1285_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.omega.2015.12.002","volume":"64","author":"SW Lin","year":"2015","unstructured":"Lin SW, Ying KC (2015) Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64:115\u2013125","journal-title":"Omega"},{"key":"1285_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2478\/v10209-011-0009-6","volume":"37","author":"T Aldowaisan","year":"2012","unstructured":"Aldowaisan T, Allahverdi A (2012) Minimizing total tardiness in no-wait flowshops. Found Comput Decis Sci 37:149\u2013162","journal-title":"Found Comput Decis Sci"},{"key":"1285_CR14","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s00170-013-4924-y","volume":"68","author":"SU Sapkal","year":"2013","unstructured":"Sapkal SU, Laha D (2013) A heuristic for no-wait flow shop scheduling. Int J Adv Manuf Technol 68:1327\u20131338","journal-title":"Int J Adv Manuf Technol"},{"key":"1285_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Gupta JND et al (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604\u2013613","journal-title":"Appl Soft Comput"},{"key":"1285_CR16","doi-asserted-by":"crossref","unstructured":"R\u00f6ck H (1984) The three-machine no-wait flow shop is NP-complete. Journal of the ACM (JACM) 31:336\u2013345","DOI":"10.1145\/62.65"},{"key":"1285_CR17","doi-asserted-by":"crossref","unstructured":"Akrout H et al (2013) New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem. In: International Conference on Advanced Logistics and Transport. IEEE, pp 327\u2013334","DOI":"10.1109\/ICAdLT.2013.6568480"},{"key":"1285_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.cie.2016.06.003","volume":"98","author":"D Laha","year":"2016","unstructured":"Laha D, Gupta JND (2016) A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Comput Ind Eng 98:373\u2013383","journal-title":"Comput Ind Eng"},{"key":"1285_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","volume":"24","author":"XS Yang","year":"2014","unstructured":"Yang XS, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput & Applic 24:169\u2013174","journal-title":"Neural Comput & Applic"},{"key":"1285_CR20","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.cie.2009.02.006","volume":"57","author":"B Qian","year":"2009","unstructured":"Qian B, Wang L, Hu R et al (2009) A DE-based approach to no-wait flow-shop scheduling. Computers & Industrial Engineering 57:787\u2013805","journal-title":"Computers & Industrial Engineering"},{"key":"1285_CR21","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ijpe.2010.06.006","volume":"128","author":"LY Tseng","year":"2010","unstructured":"Tseng LY, Lin YT (2010) A hybrid genetic algorithm for no-wait flowshop scheduling problem. Int J Prod Econ 128:144\u2013152","journal-title":"Int J Prod Econ"},{"key":"1285_CR22","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s00170-010-3009-4","volume":"54","author":"B Jarboui","year":"2011","unstructured":"Jarboui B, Eddaly M, Siarry P (2011) A hybrid genetic algorithm for solving no-wait flowshop scheduling problems. Int J Adv Manuf Technol 54:1129\u20131143","journal-title":"Int J Adv Manuf Technol"},{"key":"1285_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2011.648277","volume":"50","author":"H Samarghandi","year":"2012","unstructured":"Samarghandi H, ElMekkawy TY (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. Int J Prod Res 50:1\u201314","journal-title":"Int J Prod Res"},{"key":"1285_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mcm.2011.05.029","volume":"57","author":"D Davendra","year":"2013","unstructured":"Davendra D, Zelinka I, Bialic-Davendra M et al (2013) Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Math Comput Model 57:100\u2013110","journal-title":"Math Comput Model"},{"key":"1285_CR25","unstructured":"Yang Xin She, Deb S (2010) Cuckoo Search via Lvy flights. In: Nature & Biologically Inspired Computing. NaBIC 2009. World Congress on IEEE, pp 210\u2013214"},{"key":"1285_CR26","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"KH Han","year":"2002","unstructured":"Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6:580\u2013593","journal-title":"IEEE Trans Evol Comput"},{"key":"1285_CR27","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.engappai.2015.01.002","volume":"40","author":"H Nezamabadi-pour","year":"2015","unstructured":"Nezamabadi-pour H (2015) A quantum-inspired gravitational search algorithm for binary encoded optimization problems. Eng Appl Artif Intell 40:62\u201375","journal-title":"Eng Appl Artif Intell"},{"key":"1285_CR28","first-page":"12","volume":"1","author":"A Draa","year":"2011","unstructured":"Draa A, Meshoul S, Talbi H et al (2011) A quantum-inspired differential evolution algorithm for solving the N-queens problem. Neural Netw 1:12","journal-title":"Neural Netw"},{"key":"1285_CR29","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1051\/ro\/1978120403331","volume":"12","author":"Jacques Carlier","year":"2011","unstructured":"Carlier Jacques (2011) Ordonnancements contraintes disjonctives. RAIRO - Operations Research 12:333\u2013350","journal-title":"RAIRO - Operations Research"},{"key":"1285_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) A genetic algorithm for flowshop sequencing. Computers & operations research 22:5\u201313","journal-title":"Computers & operations research"},{"key":"1285_CR31","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 programs. Eur J Oper Res 64:278\u2013285","journal-title":"Eur J Oper Res"},{"key":"1285_CR32","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00170-009-2438-4","volume":"49","author":"T Zheng","year":"2010","unstructured":"Zheng T, Yamashiro M (2010) Solving flow shop scheduling problems by quantum differential evolutionary algorithm. Int J Adv Manuf Technol 49:643\u2013662","journal-title":"Int J Adv Manuf Technol"},{"key":"1285_CR33","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.neucom.2007.11.017","volume":"72","author":"P Li","year":"2008","unstructured":"Li P, Li S (2008) Quantum-inspired evolutionary algorithm for continuous space optimization based on Bloch coordinates of qubits. Neurocomputing 72:581\u2013591","journal-title":"Neurocomputing"},{"key":"1285_CR34","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"JM Framinan","year":"2003","unstructured":"Framinan JM, Leisten R (2003) An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31:311\u2013317","journal-title":"Omega"},{"key":"1285_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2016.1150615","volume":"54","author":"X Qi","year":"2016","unstructured":"Qi X, Wang H, Zhu H et al (2016) Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization. Int J Prod Res 54:1\u201316","journal-title":"Int J Prod Res"},{"key":"1285_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jmsy.2017.04.007","volume":"44","author":"Honghan Ye","year":"2017","unstructured":"Ye Honghan, Li W, Miao E (2017) An improved heuristic for no-wait flow shop to minimize makespan. J Manuf Syst 44:273\u2013279","journal-title":"J Manuf Syst"},{"key":"1285_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"HG Beyer","year":"2002","unstructured":"Beyer HG, Schwefel HP (2002) Evolution strategiesCA comprehensive introduction. Nat Comput 1:3\u201352","journal-title":"Nat Comput"},{"key":"1285_CR38","first-page":"158","volume":"48","author":"D Montgomery","year":"2005","unstructured":"Montgomery D (2005) Design and analysis of experiments. Technometrics 48:158\u2013158","journal-title":"Technometrics"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1285-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1285-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1285-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:33:22Z","timestamp":1568936002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1285-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,20]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["1285"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1285-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,20]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}