{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:53Z","timestamp":1740098933162,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319669625"},{"type":"electronic","value":"9783319669632"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66963-2_53","type":"book-chapter","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T07:15:18Z","timestamp":1503904518000},"page":"601-612","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Genetic Algorithm and Particle Swarm Optimization for Flow Shop Scheduling Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8818-0901","authenticated-orcid":false,"given":"Lindsay Alvarez","family":"Pomar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8222-6086","authenticated-orcid":false,"given":"Elizabeth","family":"Cruz Pulido","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0021-3308","authenticated-orcid":false,"given":"Juli\u00e1n Dar\u00edo","family":"Tovar Roa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"53_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling, Theory, Algorithms, and Systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling, Theory, Algorithms, and Systems, 4th edn. Springer, New York (2012). doi:\n10.1007\/978-1-4614-2361-4","edition":"4"},{"issue":"2","key":"53_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976). doi:\n10.1287\/moor.1.2.117","journal-title":"Math. Oper. Res."},{"issue":"1","key":"53_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"C Liou","year":"2015","unstructured":"Liou, C., Hsieh, Y.: A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. Int. J. Prod. Econ. 170(1), 258\u2013267 (2015). doi:\n10.1016\/j.ijpe.2015.10.002","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"53_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"P Franca","year":"2005","unstructured":"Franca, P., Gupta, J., Mendes, A., Moscato, P., Veltink, K.: Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Comput. Ind. Eng. 48(3), 491\u2013506 (2005). doi:\n10.1016\/j.cie.2003.11.004","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"53_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cor.2009.04.013","volume":"37","author":"N Salmasi","year":"2010","unstructured":"Salmasi, N., Logendran, R., Skandari, M.: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput. Oper. Res. 37(1), 199\u2013212 (2010). doi:\n10.1016\/j.cor.2009.04.013","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"53_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1504\/ejie.2012.045604","volume":"6","author":"B Naderi","year":"2012","unstructured":"Naderi, B., Salmasi, N.: Permutation flowshops in group scheduling with sequence-dependent setup times. Eur. J. Ind. Eng. 6(2), 177\u2013198 (2012). doi:\n10.1504\/ejie.2012.045604","journal-title":"Eur. J. Ind. Eng."},{"issue":"1","key":"53_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.eswa.2015.12.001","volume":"51","author":"W Shao","year":"2016","unstructured":"Shao, W., Pi, D.: A self-guided differential evolution with neighborhood search for permutation flow shop scheduling. Expert Syst. Appl. 51(1), 161\u2013176 (2016). doi:\n10.1016\/j.eswa.2015.12.001","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"53_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ijpe.2009.02.005","volume":"119","author":"X Wang","year":"2009","unstructured":"Wang, X., Cheng, T.: Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers. Int. J. Prod. Econ. 119(1), 199\u2013206 (2009). doi:\n10.1016\/j.ijpe.2009.02.005","journal-title":"Int. J. Prod. Econ."},{"key":"53_CR9","volume-title":"Adaptation in Natural and Artificial Systems","author":"J Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)"},{"key":"53_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73190-0","volume-title":"Introduction to Genetic Algorithms","author":"S Sivanandam","year":"2008","unstructured":"Sivanandam, S., Deepa, S.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-73190-0"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: International Conference on Neural Networks, Perth, Australia (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","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.: A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput. Ind. Eng. 58(1), 1\u201311 (2010). doi:\n10.1016\/j.cie.2009.01.016","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"53_CR13","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. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993). doi:\n10.1016\/0377-2217(93)90182-m","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66963-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T07:33:37Z","timestamp":1503905617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66963-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319669625","9783319669632"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66963-2_53","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}