{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:52:08Z","timestamp":1743051128716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319897424"},{"type":"electronic","value":"9783319897431"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89743-1_35","type":"book-chapter","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T18:28:27Z","timestamp":1523471307000},"page":"399-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Hybrid Genetic Algorithm to Deal with the Flow Shop Scheduling Problem for Makespan Minimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3862-0523","authenticated-orcid":false,"given":"Fatima Zohra","family":"Boumediene","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yamina","family":"Houbad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Hassam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lat\u00e9fa","family":"Ghomri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"35_CR1","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"35_CR2","unstructured":"Dorigo, M., DiCaro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw Hill, London, UK, pp. 11\u201332 (1999)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2010.05.002","volume":"192","author":"Peter Koro\u0161ec","year":"2012","unstructured":"Koro\u0161ec, P., \u0160ilc, J., Filipi\u010d, B.: The differential ant-stigmergy algorithm. Inf. Sci. 192, 82\u201397 (1999). http:\/\/dx.doi.org\/10.1016\/j. ins.2010.05.002","journal-title":"Information Sciences"},{"key":"35_CR4","first-page":"379","volume-title":"New Ideas in Optimization","author":"J Kennedy","year":"1999","unstructured":"Kennedy, J., Eberhart, R.: The particle swarm optimization: social adaptation in information processing. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 379\u2013387. McGraw Hill, London (1999)"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Glob. Optim."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Fister, I. Jr., Brest, J., \u017dumer, V.: Memetic artificial bee colony algorithm for large-scale global optimization. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012)","DOI":"10.1109\/CEC.2012.6252938"},{"key":"35_CR7","first-page":"1","volume-title":"Metaheuristic Application in Structures and Infrastructures","author":"A Gandomi","year":"2013","unstructured":"Gandomi, A., Yang, X.-S., Talatahari, S., Alavi, A.: Metaheuristic in modeling and optimization. In: Gandomi, A., Yang, X.-S., Talatahari, S., Alavi, A. (eds.) Metaheuristic Application in Structures and Infrastructures, pp. 1\u201324. Elsevier, Waltham (2013)"},{"key":"35_CR8","first-page":"1","volume-title":"Metaheuristic in Water Geotechnical and Transport Engineering","author":"XS Yang","year":"2013","unstructured":"Yang, X.S.: Optimization and metaheuristic algorithms in engineering. In: Yangetal, X.-S. (ed.) Metaheuristic in Water Geotechnical and Transport Engineering, pp. 1\u201323. Elsevier, Waltham (2013)"},{"key":"35_CR9","first-page":"26","volume-title":"Metaheuristic Applications in Structures and Infrastructures","author":"M Sahab","year":"2013","unstructured":"Sahab, M., Toropov, V., Gandomi, A.: Traditional and modern optimization techniques \u2013 theory and application. In: Gandomi, A.H., et al. (eds.) Metaheuristic Applications in Structures and Infrastructures, pp. 26\u201347. Elsevier, Waltham (2013)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via levy flights. In: World Congress on Nature & Biologically Inspired Computing (NaBIC2009), pp. 210\u2013214. IEEE Publications (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Juig, Z.: An improved ant colony for permutation flow shop scheduling to minimize makespan. In: 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (2013)","DOI":"10.1109\/PDCAT.2012.48"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.2174\/1874444301406010062","volume":"6","author":"J Zhang","year":"2014","unstructured":"Zhang, J., Tongand, J., Ma, Y.: An effective hybrid ant colony optimization for permutation flow shop scheduling. Open Autom. Control Syst. J. 6, 62\u201368 (2014)","journal-title":"Open Autom. Control Syst. J."},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar, F.: A new ant colony algorithm for makespan minimization in permutation flow shop. Comput. Ind. Eng. 63, 355\u2013361 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"35_CR14","unstructured":"Dorigo, M.: Optimization, learning and natural algorithm. Ph.D. thesis, DEI, Politecnico di Milano, Italy (1992). (in Italian)"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26, 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1057\/palgrave.jors.2601906","volume":"56","author":"O Holthaus","year":"2005","unstructured":"Holthaus, O., Rajendran, C.: A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs. J. Oper. Res. Soc. 56, 947\u2013953 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.jmatprotec.2008.03.013","volume":"209","author":"S Marimuthu","year":"2009","unstructured":"Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. J. Mater. Process. Technol. 209, 1026\u20131041 (2009)","journal-title":"J. Mater. Process. Technol."},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.ijpe.2007.06.007","volume":"112","author":"BMT Lin","year":"2008","unstructured":"Lin, B.M.T., Lu, C.Y., Shyu, S.J., Tsai, C.Y.: Development of new features of ant colony optimization for flowshop scheduling. Int. J. Prod. Econ. 112, 742\u2013755 (2008)","journal-title":"Int. J. Prod. Econ."},{"key":"35_CR19","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 flow shop scheduling to minimize makespan\/total flow time of jobs. Eur. J. Oper. Res. 155, 426\u2013438 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR20","volume-title":"Algorithmes de Fourmis Artificielles: Application \u00e0 la Classification et l\u2019Optimisation","author":"N Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9, N.: Algorithmes de Fourmis Artificielles: Application \u00e0 la Classification et l\u2019Optimisation. University of Fran\u00e7ois Rabelais, Tours (2000)"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9, N., Venturini, G., Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm. Future Gener. Comput. Syst. 16, 937\u2013946 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"35_CR22","unstructured":"Debbat, F., Bendimerad, F.T.: Radiation pattern optimization by apicalis ant algorithm for smart array antennas. Int. J. Sci. Eng. Res. 3(11) (2012)"},{"key":"35_CR23","unstructured":"Houbad, Y., Souier, M., Hassam, A., Sari, Z.: Algorithme API hybride pour la resolution du problem de selection de routages alternatives dans un FMS. In: International Conference on Systems and Processing Information, Guelma, Algeria (2013)"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"532","DOI":"10.4028\/www.scientific.net\/AMM.232.532","volume":"232","author":"H Yamina","year":"2012","unstructured":"Yamina, H., Mehdi, S., Ahmed, H., Zaki, S., Fay\u00e7al, B.: An APIm algorithm to solve the scheduling problem in an FMS with presence of breakdowns. Appl. Mech. Mater. 232, 532\u2013536 (2012)","journal-title":"Appl. Mech. Mater."}],"container-title":["IFIP Advances in Information and Communication Technology","Computational Intelligence and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89743-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:48:54Z","timestamp":1709815734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89743-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319897424","9783319897431"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89743-1_35","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}