{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:51:50Z","timestamp":1762955510479,"version":"3.37.3"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T00:00:00Z","timestamp":1455235200000},"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":["61305150"],"award-info":[{"award-number":["61305150"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00500-016-2062-9","type":"journal-article","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T14:48:42Z","timestamp":1455288522000},"page":"4297-4307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":58,"title":["A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8213-1626","authenticated-orcid":false,"given":"Hui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahryar","family":"Rahnamayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanyou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,12]]},"reference":[{"key":"2062_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ijepes.2015.08.018","volume":"75","author":"SM Abd Elazim","year":"2016","unstructured":"Abd Elazim SM, Ali ES (2016) Optimal power system stabilizers design via cuckoo search algorithm. Int J Electr Power Energy Syst 75:99\u2013107","journal-title":"Int J Electr Power Energy Syst"},{"issue":"2","key":"2062_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0925-5273(03)00184-1","volume":"88","author":"C Andreas","year":"2004","unstructured":"Andreas C (2004) Nearchou. The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economics 88(2):191\u2013203","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"2062_CR3","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1080\/05695557708975160","volume":"9","author":"SP Bansal","year":"1977","unstructured":"Bansal SP (1977) Minimizing the sum of completion times of n jobs over m machines in a flowshopa branch and bound approach. AIIE Trans. 9(3):306\u2013311","journal-title":"AIIE Trans."},{"key":"2062_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.energy.2013.07.011","volume":"60","author":"M Basu","year":"2013","unstructured":"Basu M, Chowdhury A (2013) Cuckoo search algorithm for economic dispatch. Energy 60:99\u2013108","journal-title":"Energy"},{"issue":"7","key":"2062_CR5","doi-asserted-by":"crossref","first-page":"3538","DOI":"10.1016\/j.eswa.2013.10.059","volume":"41","author":"AK Bhandari","year":"2014","unstructured":"Bhandari AK, Singh VK, Kumar A, Singh GK (2014) Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using kapurs entropy. Expert Syst Appl 41(7):3538\u20133560","journal-title":"Expert Syst Appl"},{"key":"2062_CR6","doi-asserted-by":"crossref","unstructured":"Chen J, Lin Q, Hu Q (2010) Application of novel clonal algorithm in multiobjective optimization. International Journal of Information Technology & Decision Making 9(02):239\u2013266","DOI":"10.1142\/S0219622010003804"},{"issue":"1","key":"2062_CR7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s10851-014-0511-6","volume":"51","author":"B Chen","year":"2015","unstructured":"Chen B, Shu H, Coatrieux G, Chen G, Sun X, Coatrieux JL (2015) Color image analysis by quaternion-type moments. J Math Imaging Vis 51(1):124\u2013144","journal-title":"J Math Imaging Vis"},{"issue":"2","key":"2062_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"FD Croce","year":"2002","unstructured":"Croce FD, Ghirardi M, Tadei R (2002) An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Eur J Oper Res 139(2):293\u2013301","journal-title":"Eur J Oper Res"},{"key":"2062_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2015.09.006","volume":"67","author":"L Cui","year":"2016","unstructured":"Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155\u2013173","journal-title":"Comput Oper Res"},{"issue":"6","key":"2062_CR10","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1504\/IJMC.2011.042781","volume":"9","author":"M Dhivya","year":"2011","unstructured":"Dhivya M, Sundarambal M (2011) Cuckoo search for data gathering in wireless sensor networks. Int J Mob Commun 9(6):642\u2013656","journal-title":"Int J Mob Commun"},{"issue":"3","key":"2062_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1504\/IJBIC.2015.069554","volume":"7","author":"H Djelloul","year":"2015","unstructured":"Djelloul H, Layeb A, Chikhi S (2015) Quantum inspired cuckoo search algorithm for graph colouring problem. Int J Bio-Inspired Comput 7(3):183\u2013194","journal-title":"Int J Bio-Inspired Comput"},{"issue":"1","key":"2062_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"2062_CR13","doi-asserted-by":"crossref","unstructured":"Fu Z, Sun X, Liu Q, Zhou L, Shu J (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun E98\u2013B(1):190\u2013200","DOI":"10.1587\/transcom.E98.B.190"},{"issue":"10","key":"2062_CR14","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"issue":"3","key":"2062_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/HIS-130169","volume":"10","author":"S Goel","year":"2013","unstructured":"Goel S, Sharma A, Bedi P (2013) Novel approaches for classification based on cuckoo search strategy. Int J Hybrid Intell Syst 10(3):107\u2013116","journal-title":"Int J Hybrid Intell Syst"},{"issue":"7","key":"2062_CR16","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1109\/TNNLS.2014.2342533","volume":"26","author":"B Gu","year":"2015","unstructured":"Gu B, Sheng VS, Tay KY, Romano W, Li S (2015a) Incremental support vector learning for ordinal regression. IEEE Trans Neural Netw Learn Syst 26(7):1403\u20131416","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2062_CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.neunet.2015.03.013","volume":"67","author":"B Gu","year":"2015","unstructured":"Gu B, Sheng VS, Wang Z, Ho D, Osman S, Li S (2015b) Incremental learning for $$\\nu $$ \u03bd -support vector regression. Neural Netw 67:140\u2013150","journal-title":"Neural Netw"},{"key":"2062_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.asoc.2015.07.031","volume":"36","author":"J Huang","year":"2015","unstructured":"Huang J, Gao L, Li X (2015) An effective teaching-learning-based cuckoo search algorithm for parameter optimization problems in structure designing and machining processes. Appl Soft Comput 36:349\u2013356","journal-title":"Appl Soft Comput"},{"issue":"3","key":"2062_CR19","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall E, Schrage L (1965) Application of the branch and bound technique to some flow-shop scheduling problems. Oper Res 13(3):400\u2013412","journal-title":"Oper Res"},{"issue":"1","key":"2062_CR20","doi-asserted-by":"crossref","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. Naval Res Logist Q 1(1):61\u201368","journal-title":"Naval Res Logist Q"},{"key":"2062_CR21","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report, Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"issue":"6","key":"2062_CR22","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1504\/IJBIC.2015.073165","volume":"7","author":"S Karthikeyan","year":"2015","unstructured":"Karthikeyan S, Asokan P, Nickolas S, Page T (2015) A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int J Bio-Inspired Comput 7(6):386\u2013401","journal-title":"Int J Bio-Inspired Comput"},{"key":"2062_CR23","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942\u20131948","journal-title":"IEEE Int Conf Neural Netw"},{"issue":"3","key":"2062_CR24","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/TIFS.2014.2381872","volume":"10","author":"J Li","year":"2015","unstructured":"Li J, Li X, Yang B, Sun X (2015) Segmentation-based image copy-move forgery detection scheme. IEEE Trans Inf Forensics Secur 10(3):507\u2013518","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2062_CR25","doi-asserted-by":"crossref","unstructured":"Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fractals 35(5):851\u2013861","DOI":"10.1016\/j.chaos.2006.05.082"},{"issue":"5\u20138","key":"2062_CR26","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00170-010-3111-7","volume":"55","author":"J Liang","year":"2011","unstructured":"Liang J, Pan Q-K, Tiejun C, Wang L (2011) Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer. Int J Adv Manuf Technol 55(5\u20138):755\u2013762","journal-title":"Int J Adv Manuf Technol"},{"key":"2062_CR27","doi-asserted-by":"crossref","unstructured":"Liang Z, Song R, Lin Q, Du Z, Chen J, Ming Z, Yu J (2015) A double-module immune algorithm for multi-objective optimization problems. App Soft Comput 35:161\u2013174","DOI":"10.1016\/j.asoc.2015.06.022"},{"key":"2062_CR28","doi-asserted-by":"crossref","unstructured":"Liang Z, Sun J, Lin Q, Du Z, Chen J, Ming Z (2016) A novel multiple rule sets data classification algorithm based on ant colony algorithm. Appl Soft Comput 38:1000\u20131011","DOI":"10.1016\/j.asoc.2015.10.046"},{"key":"2062_CR29","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cor.2015.04.003","volume":"62","author":"Q Lin","year":"2015","unstructured":"Lin Q, Zhu Q, Huang P, Chen J, Ming Z, Yu J (2015a) A novel hybrid multi-objective immune algorithm with adaptive differential evolution. Comput Oper Res 62:95\u2013111","journal-title":"Comput Oper Res"},{"key":"2062_CR30","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.cie.2015.04.009","volume":"85","author":"Q Lin","year":"2015","unstructured":"Lin Q, Gao L, Li X, Zhang C (2015b) A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput Ind Eng 85:437\u2013446","journal-title":"Comput Ind Eng"},{"issue":"6","key":"2062_CR31","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1016\/j.cor.2011.11.011","volume":"40","author":"Q Lin","year":"2013","unstructured":"Lin Q, Chen J (2013) A novel micro-population immune multiobjective optimization algorithm. Comput Oper Res 40(6):1590\u20131601","journal-title":"Comput Oper Res"},{"issue":"1","key":"2062_CR32","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y-H (2007) An effective pso-based memetic algorithm for flow shop scheduling. IEEE Trans Sys Man Cybern Part B Cybern 37(1):18\u201327","journal-title":"IEEE Trans Sys Man Cybern Part B Cybern"},{"issue":"6","key":"2062_CR33","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.scient.2012.10.034","volume":"19","author":"X Li","year":"2012","unstructured":"Li X, Yin M (2012) A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem. Scientia Iranica 19(6):1921\u20131935","journal-title":"Scientia Iranica"},{"issue":"16","key":"2062_CR34","doi-asserted-by":"crossref","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013a) A hybrid cuckoo search via L\u00e9vy flights for the permutation flow shop scheduling problem. Int J Prod Res 51(16):4732\u20134754","journal-title":"Int J Prod Res"},{"key":"2062_CR35","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.advengsoft.2012.09.003","volume":"55","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013b) An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure. Adv Eng Softw 55:10\u201331","journal-title":"Adv Eng Softw"},{"issue":"4","key":"2062_CR36","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1587\/transinf.2014EDP7283","volume":"E98\u2013D","author":"T Ma","year":"2015","unstructured":"Ma T, Zhou J, Tang M, Tian Y, Al-dhelaan A, Al-rodhann M, Lee S (2015) Social network and tag sources based augmenting collaborative recommender system. IEICE Trans Inf Syst E98\u2013D(4):902\u2013910","journal-title":"IEICE Trans Inf Syst"},{"issue":"4","key":"2062_CR37","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1504\/IJBIC.2012.048061","volume":"4","author":"MK Marichelvam","year":"2012","unstructured":"Marichelvam MK (2012) An improved hybrid cuckoo search (ihcs) metaheuristics algorithm for permutation flow shop scheduling problems. Int J Bio-Inspired Comput 4(4):200\u2013205","journal-title":"Int J Bio-Inspired Comput"},{"key":"2062_CR38","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.jngse.2014.11.017","volume":"22","author":"B Masoud","year":"2015","unstructured":"Masoud B, Hooshang J-R (2015) Robust data-driven soft sensor based on iteratively weighted least squares support vector regression optimized by the cuckoo optimization algorithm. J Nat Gas Sci Eng 22:35\u201341","journal-title":"J Nat Gas Sci Eng"},{"key":"2062_CR39","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co., San Francisco"},{"issue":"11","key":"2062_CR40","doi-asserted-by":"crossref","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","journal-title":"Comput Oper Res"},{"key":"2062_CR41","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.asoc.2015.10.039","volume":"38","author":"MK Naik","year":"2016","unstructured":"Naik MK, Panda R (2016) A novel adaptive cuckoo search algorithm for intrinsic discriminant analysis based face recognition. Appl Soft Comput 38:661\u2013675","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2062_CR42","doi-asserted-by":"crossref","first-page":"44","DOI":"10.7763\/IJMO.2015.V5.434","volume":"5","author":"NJ Navimipour","year":"2015","unstructured":"Navimipour NJ (2015) Milani FS (2015) Task scheduling in the cloud computing based on the cuckoo search algorithm. Int J Model Optim 5(1):44","journal-title":"Int J Model Optim"},{"issue":"1","key":"2062_CR43","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M (1983) E Emory Enscore, and Inyong Ham. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"7\u20138","key":"2062_CR44","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B Qian","year":"2008","unstructured":"Qian B, Wang L, Rong H, Wang W-L, Huang D-X, Wang X (2008) A hybrid differential evolution method for permutation flow-shop scheduling. Int J Adv Manuf Technol 38(7\u20138):757\u2013777","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"2062_CR45","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","volume":"247","author":"HF Rahman","year":"2015","unstructured":"Rahman HF (2015) Ruhul Sarker, and Daryl Essam. A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Oper Res 247(2):488\u2013503","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2062_CR46","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama M (2008) Opposition-based differential evolution. Evol Comput IEEE Trans 12(1):64\u201379","journal-title":"Evol Comput IEEE Trans"},{"issue":"2","key":"2062_CR47","first-page":"317","volume":"16","author":"Y Ren","year":"2015","unstructured":"Ren Y, Shen J, Wang J, Han J, Lee S (2015) Mutual verifiable provable data auditing in public cloud storage. J Internet Technol 16(2):317\u2013323","journal-title":"J Internet Technol"},{"key":"2062_CR48","unstructured":"Sajwan M, Acharya K, Bhargava S (2014) Swarm intelligence based optimization for web usage mining in recommender system. International Journal of Computer Applications Technology and Research 3(2):119\u2013124"},{"issue":"1","key":"2062_CR49","first-page":"171","volume":"16","author":"J Shen","year":"2015","unstructured":"Shen J, Tan H, Wang J, Wang J, Lee S (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171\u2013178","journal-title":"J Internet Technol"},{"issue":"1","key":"2062_CR50","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65\u201374","journal-title":"Eur J Oper Res"},{"issue":"22","key":"2062_CR51","doi-asserted-by":"crossref","first-page":"4737","DOI":"10.1080\/00207540600620849","volume":"44","author":"MF Tasgetiren","year":"2006","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int J Prod Res 44(22):4737\u20134754","journal-title":"Int J Prod Res"},{"issue":"3","key":"2062_CR52","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"key":"2062_CR53","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: A new scheme for machine intelligence. In: International conference on computational intelligence for modelling control and automation IEEE, pp 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"2062_CR54","doi-asserted-by":"crossref","unstructured":"Wang H, Wu Z, Rahnamayan S (2011a) Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems. Soft Comput 15(11):2127\u20132140","DOI":"10.1007\/s00500-010-0642-7"},{"key":"2062_CR55","doi-asserted-by":"crossref","unstructured":"Wang H, Wu Z, Rahnamayan S, Liu Y, Ventresca M (2011b) Enhancing particle swarm optimization using generalized opposition-based learning. Inf Sci 181(20):4699\u20134714","DOI":"10.1016\/j.ins.2011.03.016"},{"issue":"2","key":"2062_CR56","doi-asserted-by":"crossref","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 12(2):652\u2013662","journal-title":"Appl Soft Comput"},{"key":"2062_CR57","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"X Wen","year":"2015","unstructured":"Wen X, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295:395\u2013406","journal-title":"Inf Sci"},{"issue":"1","key":"2062_CR58","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"2062_CR59","doi-asserted-by":"publisher","unstructured":"Xia Z, Wang X, Sun X, Liu Q, Xiong N (2014a) Steganalysis of LSB matching using differences between nonadjacent pixels. Multimed Tools Appl. doi: 10.1007\/s11042-014-2381-8","DOI":"10.1007\/s11042-014-2381-8"},{"issue":"8","key":"2062_CR60","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1002\/sec.864","volume":"7","author":"Z Xia","year":"2014","unstructured":"Xia Z, Wang X, Sun X, Wang B (2014b) Steganalysis of least significant bit matching using multi-order differences. Secur Commun Netw 7(8):1283\u20131291","journal-title":"Secur Commun Netw"},{"key":"2062_CR61","doi-asserted-by":"publisher","unstructured":"Xia Z, Wang X, Sun X, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst. doi: 10.1109\/TPDS.2015.2401003","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"2062_CR62","doi-asserted-by":"crossref","unstructured":"Xie S, Wang Y (2014) Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wireless personal communications 78(1):231\u2013246","DOI":"10.1007\/s11277-014-1748-5"},{"key":"2062_CR63","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: World congress on nature and biologically inspired computing IEEE, pp 210\u2013214"},{"key":"2062_CR64","doi-asserted-by":"crossref","DOI":"10.1002\/9780470640425","volume-title":"Engineering optimization: an introduction with metaheuristic applications","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, New York"},{"issue":"4","key":"2062_CR65","first-page":"330","volume":"1","author":"X-S Yang","year":"2010","unstructured":"Yang X-S, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330\u2013343","journal-title":"Int J Math Model Numer Optim"},{"issue":"1","key":"2062_CR66","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2009.01.016","volume":"58","author":"C Zhang","year":"2010","unstructured":"Zhang C, Ning J, Ouyang D (2010a) A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput Ind Eng 58(1):1\u201311","journal-title":"Comput Ind Eng"},{"issue":"8","key":"2062_CR67","doi-asserted-by":"crossref","first-page":"5827","DOI":"10.1016\/j.eswa.2010.02.024","volume":"37","author":"J Zhang","year":"2010","unstructured":"Zhang J, Zhang C, Liang S (2010b) The circular discrete particle swarm optimization algorithm for flow shop scheduling problem. Expert Syst Appl 37(8):5827\u20135834","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2062_CR68","doi-asserted-by":"crossref","first-page":"5162","DOI":"10.1016\/j.eswa.2008.06.036","volume":"36","author":"C Zhang","year":"2009","unstructured":"Zhang C, Sun J (2009) An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Expert Syst Appl 36(3):5162\u20135167","journal-title":"Expert Syst Appl"},{"key":"2062_CR69","doi-asserted-by":"crossref","unstructured":"Zheng Y, Jeon B, Xu D, Wu QM, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intel Fuzzy Syst 28(2):961\u2013973","DOI":"10.3233\/IFS-141378"},{"key":"2062_CR70","unstructured":"Zhao F, Zhang J, Wang J, Zhang C (2015) A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problem. Int J Comput Integr Manuf 28(11):1220\u20131235"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2062-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2062-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2062-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2062-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T10:05:42Z","timestamp":1600164342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2062-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,12]]},"references-count":70,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["2062"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2062-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,2,12]]}}}