{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:35Z","timestamp":1740099155166,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":40,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811328251"},{"type":"electronic","value":"9789811328268"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2826-8_26","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T09:36:02Z","timestamp":1538818562000},"page":"295-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced Biogeography-Based Optimization for Flow-Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Yi-Chen","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Xia","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ci-Yun","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Jun","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,7]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2015.01.005","volume":"60","author":"P Dasgupta","year":"2015","unstructured":"Dasgupta, P., Das, S.: A discrete inter-species cuckoo search for flowshop scheduling problems. Comput. Oper. Res. 60, 111\u2013120 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"26_CR2","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1057\/palgrave.jors.2601766","volume":"55","author":"O Etiler","year":"2004","unstructured":"Etiler, O., Toklu, B., Atak, M., Wilson, J.: A genetic algorithm for flow shop scheduling problems. J. Oper. Res. Soc. 55(8), 830\u2013835 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"J Framinan","year":"2004","unstructured":"Framinan, J., Gupta, J., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55, 1243\u20131255 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.asoc.2017.12.009","volume":"68","author":"Y Fu","year":"2018","unstructured":"Fu, Y., Ding, J., Wang, H., Wang, J.: Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system. Appl. Soft Comput. 68, 847\u2013855 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"26_CR6","first-page":"1","volume":"5","author":"U Gupta","year":"2015","unstructured":"Gupta, U., Kumar, S.: Minimization of weighted sum of total tardiness and make span in no wait flow shop scheduling using different heuristic algorithm: a review. Int. J. Adv. Eng. Sci. 5(4), 1\u201310 (2015)","journal-title":"Int. J. Adv. Eng. Sci."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cie.2015.02.009","volume":"83","author":"CY Hsu","year":"2015","unstructured":"Hsu, C.Y., Chang, P.C., Chen, M.H.: A linkage mining in block-based evolutionary algorithm for permutation flowshop scheduling problem. Comput. Ind. Eng. 83, 159\u2013171 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"26_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0305-0548(95)00034-8","volume":"23","author":"JK Karlof","year":"1996","unstructured":"Karlof, J.K., Wang, W.: Bilevel programming applied to the flow shop scheduling problem. Comput. Oper. Res. 23(5), 443\u2013451 (1996)","journal-title":"Comput. Oper. Res."},{"unstructured":"Krasnogor, N., Smith, J.: A memetic algorithm with self-adaptive local search: TSP as a case study. In: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, pp. 987\u2013994. Morgan Kaufmann Publishers Inc. (2000)","key":"26_CR9"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"7027","DOI":"10.1016\/j.eswa.2008.08.054","volume":"36","author":"IH Kuo","year":"2009","unstructured":"Kuo, I.H., et al.: An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Syst. Appl. 36(3), 7027\u20137032 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"26_CR11","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00170-010-3111-7","volume":"55","author":"JJ Liang","year":"2011","unstructured":"Liang, J.J., Pan, Q.K., Tiejun, C., Wang, L.: Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer. Int. J. Adv. Manuf. Technol. 55(5), 755\u2013762 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"10","key":"26_CR12","doi-asserted-by":"publisher","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"CJ Liao","year":"2007","unstructured":"Liao, C.J., Tseng, C.T., Luarn, P.: A discrete version of particle swarm optimization for flowshop scheduling problems. Comput. Oper. Res. 34(10), 3099\u20133111 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"16","key":"26_CR13","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1080\/00207543.2015.1094584","volume":"54","author":"J Lin","year":"2016","unstructured":"Lin, J.: A hybrid discrete biogeography-based optimization for the permutation flow-shop scheduling problem. Int. J. Prod. Res. 54(16), 4805\u20134814 (2016)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu, B., Wang, L., Jin, Y.H.: An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. Part B 37(1), 18\u201327 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"9\u201310","key":"26_CR15","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/s00170-003-1687-x","volume":"23","author":"C Low","year":"2004","unstructured":"Low, C., Yeh, J.Y., Huang, K.I.: A robust simulated annealing heuristic for flow shop scheduling problems. Int. J. Adv. Manuf. Technol. 23(9\u201310), 762\u2013767 (2004)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.engappai.2010.08.005","volume":"24","author":"H Ma","year":"2011","unstructured":"Ma, H., Simon, D.: Blended biogeography-based optimization for constrained optimization. Engin. Appl. Artif. Intell. 24(3), 517\u2013525 (2011)","journal-title":"Engin. Appl. Artif. Intell."},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1504\/IJBIC.2012.048061","volume":"4","author":"MK Marichelvam","year":"2012","unstructured":"Marichelvam, M.K.: An improved hybrid cuckoo search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems. Int. J. Bio-Inspired. Comput. 4(4), 200\u2013205 (2012)","journal-title":"Int. J. Bio-Inspired. Comput."},{"issue":"3","key":"26_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/opre.15.3.473","volume":"15","author":"GB Mcmahon","year":"1967","unstructured":"Mcmahon, G.B., Burton, P.G.: Flow-shop scheduling with the branch-and-bound method. Oper. Res. 15(3), 473\u2013481 (1967)","journal-title":"Oper. Res."},{"issue":"1","key":"26_CR19","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., Enscore, E.E., Ham, I.: A heuristic algorithm for the $$m$$-machine, $$n$$-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong, Y.S., Keane, A.J.: Meta-Lamarckian learning in memetic algorithms. IEEE Trans. Evol. Comput. 8(2), 99\u2013110 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"G Onwubolu","year":"2006","unstructured":"Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. Eur. J. Oper. Res. 171(2), 674\u2013692 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"26_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0257-2","volume":"164","author":"ACD Paternina","year":"2008","unstructured":"Paternina, A.C.D., Montoya, T.J.R., Acero, D.M.J., Herrera, H.M.C.: Scheduling jobs on a $$k$$-stage flexible flow-shop. Ann. Oper. Res. 164(1), 29\u201340 (2008)","journal-title":"Ann. Oper. Res."},{"key":"26_CR23","volume-title":"Scheduling Theory, Algorithms, and Systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, Upper Saddle River (2002)","edition":"2"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0167-6377(89)90013-8","volume":"8","author":"CN Potts","year":"1989","unstructured":"Potts, C.N., Baker, K.R.: Flow shop scheduling with lot streaming. Oper. Res. Lett. 8, 297\u2013303 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"7\u20138","key":"26_CR25","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B Qian","year":"2008","unstructured":"Qian, B., Wang, L., Hu, R., Wang, W.L., Huang, D.X., Wang, X.: A hybrid differential evolution method for permutation flow-shop scheduling. Int. J. Adv. Manuf. Technol. 38(7\u20138), 757\u2013777 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"26_CR26","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Euro. J. Oper. Res. 155(2), 426\u2013438 (2004)","journal-title":"Euro. J. Oper. Res."},{"issue":"1","key":"26_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol. Comput. 6(1), 45\u201360 (1998)","journal-title":"Evol. Comput."},{"issue":"1","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"26_CR29","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TEVC.2015.2507785","volume":"20","author":"V Santucci","year":"2016","unstructured":"Santucci, V., Baioletti, M., Milani, A.: Algebraic differential evolution algorithm for the permutation flowshop scheduling problem with total flowtime criterion. IEEE Trans. Evol. Comput. 20(5), 682\u2013694 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"26_CR30","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1057\/jors.1986.197","volume":"37","author":"WJ Selen","year":"1986","unstructured":"Selen, W.J., Hott, D.D.: A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem. J. Oper. Res. Society 37(12), 1121\u20131128 (1986)","journal-title":"J. Oper. Res. Society"},{"issue":"6","key":"26_CR31","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"26_CR32","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.: Benchmarks for basic scheduling problems. Euro. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Euro. J. Oper. Res."},{"key":"26_CR33","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.5897\/SRE10.818","volume":"6","author":"M Yin","year":"2011","unstructured":"Yin, M., Li, X.: A hybrid bio-geography based optimization for permutation flow shop scheduling. Sci. Res. Essays 6, 2078\u20132100 (2011)","journal-title":"Sci. Res. Essays"},{"key":"26_CR34","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.: A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Expert Syst. Appl. 91, 347\u2013363 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"26_CR35","first-page":"1220","volume":"28","author":"F Zhao","year":"2015","unstructured":"Zhao, F., Zhang, J., Wang, J., Zhang, C.: A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problem. Int. J. Comput. Integ. Manuf. 28(11), 1220\u20131235 (2015)","journal-title":"Int. J. Comput. Integ. Manuf."},{"issue":"1","key":"26_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.10.008","volume":"55","author":"YJ Zheng","year":"2015","unstructured":"Zheng, Y.J.: Water wave optimization: a new nature-inspired metaheuristic. Comput. Oper. Res. 55(1), 1\u201311 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"26_CR37","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1007\/s00500-013-1209-1","volume":"18","author":"YJ Zheng","year":"2014","unstructured":"Zheng, Y.J., Ling, H.F., Wu, X.B., Xue, J.Y.: Localized biogeography-based optimization. Soft Comput. 18(11), 2323\u20132334 (2014)","journal-title":"Soft Comput."},{"key":"26_CR38","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cor.2014.04.013","volume":"50","author":"YJ Zheng","year":"2014","unstructured":"Zheng, Y.J., Ling, H.F., Xue, J.Y.: Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations. Comput. Oper. Res. 50, 115\u2013127 (2014)","journal-title":"Comput. Oper. Res."},{"key":"26_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-38703-6_39","volume-title":"Advances in Swarm Intelligence","author":"Y Zheng","year":"2013","unstructured":"Zheng, Y., Wu, X., Ling, H., Chen, S.: A simplified biogeography-based optimization using a ring topology. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013. LNCS, vol. 7928, pp. 330\u2013337. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38703-6_39"},{"issue":"1","key":"26_CR40","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.amc.2006.06.092","volume":"185","author":"M Ziaee","year":"2007","unstructured":"Ziaee, M., Sadjadi, S.: Mixed binary integer programming formulations for the flow shop scheduling problems. a case study: ISD projects scheduling. Appl. Math. Comput. 185(1), 218\u2013228 (2007)","journal-title":"Appl. Math. Comput."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2826-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T13:17:33Z","timestamp":1662211053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2826-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328251","9789811328268"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2826-8_26","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}