{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:44:16Z","timestamp":1775245456911,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811328251","type":"print"},{"value":"9789811328268","type":"electronic"}],"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_24","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T05:36:02Z","timestamp":1538804162000},"page":"273-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Biogeography-Based Memetic Algorithm for Job-Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Xue-Qin","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Chen","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu-Hua","family":"Yang","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":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun, A., Sirinaovakul, B., Achalakul, T.: Job shop scheduling with the best-so-far ABC. Eng. Appl. Artif. Intel. 25(3), 583\u2013593 (2012)","journal-title":"Eng. Appl. Artif. Intel."},{"issue":"5","key":"24_CR2","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","volume":"26","author":"B \u00c7ali\u015f","year":"2015","unstructured":"\u00c7ali\u015f, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. J. Intell. Manuf. 26(5), 961\u2013973 (2015)","journal-title":"J. Intell. Manuf."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1080\/00207548908942666","volume":"27","author":"YL Chang","year":"1989","unstructured":"Chang, Y.L., Matsuo, H., Sullivan, R.: A bottleneck-based beam search for job scheduling in a flexible manufacturing system. Int. J. Prod. Res. 27, 1949\u20131961 (1989)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"24_CR4","first-page":"334","volume":"1","author":"CMA Cruz","year":"2004","unstructured":"Cruz, C.M.A., Frausto, S.J., Ramos, Q.F.: The problem of using the calculation of the critical path to solver instances of the job shop scheduling problem. Int. J. Comput. Intell. ENFORMATIKA 1(4), 334\u2013337 (2004)","journal-title":"Int. J. Comput. Intell. ENFORMATIKA"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1109\/TII.2014.2342378","volume":"10","author":"H Gao","year":"2014","unstructured":"Gao, H., Kwong, S., Fan, B., Wang, R.: A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans. Ind. Inf. 10(4), 2044\u20132054 (2014)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"2","key":"24_CR6","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":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J.F., Magalhaes, M.J.J., Resende, M.G.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77\u201395 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2008","unstructured":"Huang, K.L., Liao, C.J.: Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35(4), 1030\u20131046 (2008)","journal-title":"Comput. Oper. Res."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Kennedy, J.: Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 3, pp. 1931\u20131938 (1999)","DOI":"10.1109\/CEC.1999.785509"},{"issue":"7","key":"24_CR10","first-page":"4411","volume":"4","author":"S Lawrence","year":"1984","unstructured":"Lawrence, S.: Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Energy Proc. 4(7), 4411\u20134417 (1984)","journal-title":"Energy Proc."},{"issue":"2","key":"24_CR11","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"Z Lian","year":"2006","unstructured":"Lian, Z., Jiao, B., Gu, X.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Appl. Math. Comput. 183(2), 1008\u20131017 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"16","key":"24_CR12","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":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"TL Lin","year":"2010","unstructured":"Lin, T.L., et al.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst. Appl. 37(3), 2629\u20132636 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"18","key":"24_CR14","doi-asserted-by":"publisher","first-page":"3444","DOI":"10.1016\/j.ins.2010.05.035","volume":"180","author":"H Ma","year":"2010","unstructured":"Ma, H.: An analysis of the equilibrium of migration models for biogeography-based optimization. Inform. Sci. 180(18), 3444\u20133464 (2010)","journal-title":"Inform. Sci."},{"key":"24_CR15","volume-title":"The Theory of Biogeography","author":"R MacArthur","year":"1967","unstructured":"MacArthur, R., Wilson, E.: The Theory of Biogeography. Princeton University Press, Princeton (1967)"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/S0377-2217(03)00016-X","volume":"155","author":"DC Mattfeld","year":"2004","unstructured":"Mattfeld, D.C., Bierwirth, C.: An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur. J. Oper. Res. 155(3), 616\u2013630 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P Moscato","year":"2003","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 105\u2013144. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_5"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong, Y.S., Lim, M.H., Zhu, N., Wong, K.W.: Classification of adaptive memetic algorithms: a comparative study. IEEE Trans. Syst. Man Cybern. Part B 36(1), 141\u2013152 (2006)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"24_CR19","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"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.swevo.2017.12.005","volume":"40","author":"Z Shao","year":"2018","unstructured":"Shao, Z., Pi, D., Shao, W.: A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 40(1), 53\u201375 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"6","key":"24_CR21","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":"10","key":"24_CR22","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manag. Sci. 38(10), 1495\u20131509 (1992)","journal-title":"Manag. Sci."},{"issue":"1","key":"24_CR23","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s001700200126","volume":"20","author":"L Wang","year":"2002","unstructured":"Wang, L., Zheng, D.Z.: A modified genetic algorithm for job shop scheduling. Int. J. Adv. Manuf. Technol. 20(1), 72\u201376 (2002)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"24_CR24","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.cie.2014.04.006","volume":"73","author":"X Wang","year":"2014","unstructured":"Wang, X., Duan, H.: A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput. Ind. Eng. 73(1), 96\u2013114 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"10","key":"24_CR25","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1080\/00207543.2011.588972","volume":"50","author":"W Wisittipanich","year":"2012","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: Two enhanced differential evolution algorithms for job shop scheduling problems. Int. J. Prod. Res. 50(10), 2757\u20132773 (2012)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"24_CR26","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888\u2013896 (2010)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"24_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11047-016-9543-8","volume":"16","author":"MX Zhang","year":"2017","unstructured":"Zhang, M.X., Zhang, B., Qian, N.: University course timetabling using a new ecogeography-based optimization algorithm. Natural Comput. 16(1), 61\u201374 (2017)","journal-title":"Natural Comput."},{"issue":"3","key":"24_CR28","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1016\/j.asoc.2012.02.024","volume":"13","author":"R Zhang","year":"2013","unstructured":"Zhang, R., Song, S., Wu, C.: A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion. Appl. Soft Comput. 13(3), 1448\u20131458 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"24_CR29","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":"3","key":"24_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.09.002","volume":"43","author":"YJ Zheng","year":"2014","unstructured":"Zheng, Y.J., Ling, H.F., Shi, H.H., Chen, H.S., Chen, S.Y.: Emergency railway wagon scheduling by hybrid biogeography-based optimization. Comput. Oper. Res. 43(3), 1\u20138 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"24_CR31","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."}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:44:34Z","timestamp":1775241874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2826-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328251","9789811328268"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2826-8_24","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"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"}}]}}