{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:26:49Z","timestamp":1749508009355,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267650"},{"type":"electronic","value":"9783030267667"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26766-7_70","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"771-783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Water Wave Optimization for Flow-Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Jia-Yu","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xue","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xue-Qin","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yi-Chen","family":"Du","sequence":"additional","affiliation":[]},{"given":"Min-Xia","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"70_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 flow-shop scheduling problems. Comput. Oper. Res. 60, 111\u2013120 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.01.005","journal-title":"Comput. Oper. Res."},{"key":"70_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-981-13-2826-8_26","volume-title":"Bio-inspired Computing: Theories and Applications","author":"Y-C Du","year":"2018","unstructured":"Du, Y.-C., Zhang, M.-X., Cai, C.-Y., Zheng, Y.-J.: Enhanced biogeography-based optimization for flow-shop scheduling. In: Qiao, J., Zhao, X., Pan, L., Zuo, X., Zhang, X., Zhang, Q., Huang, S. (eds.) BIC-TA 2018. CCIS, vol. 951, pp. 295\u2013306. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-13-2826-8_26"},{"key":"70_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin, O., G\u00fc\u00e7l\u00fc, A.: A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl. Soft Comput. 72, 166\u2013176 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2018.08.002","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"70_CR4","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). https:\/\/doi.org\/10.1057\/palgrave.jors.2601766","journal-title":"J. Oper. Res. Soc."},{"key":"70_CR5","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). https:\/\/doi.org\/10.1016\/j.asoc.2017.12.009","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"70_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":"3","key":"70_CR7","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":"10","key":"70_CR8","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). https:\/\/doi.org\/10.1016\/j.cor.2005.11.017","journal-title":"Comput. Oper. Res."},{"issue":"16","key":"70_CR9","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). https:\/\/doi.org\/10.1080\/00207543.2015.1094584","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"70_CR10","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). https:\/\/doi.org\/10.1504\/IJBIC.2012.048061","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"1","key":"70_CR11","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). https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"issue":"2","key":"70_CR12","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). https:\/\/doi.org\/10.1016\/j.ejor.2004.08.043","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"70_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"QK Pan","year":"2008","unstructured":"Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4), 795\u2013816 (2008). https:\/\/doi.org\/10.1016\/j.cie.2008.03.003","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"70_CR14","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. Eur. J. Oper. Res. 155(2), 426\u2013438 (2004). https:\/\/doi.org\/10.1016\/S0377-2217(02)00908-6","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"70_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5\u201313 (1995). https:\/\/doi.org\/10.1016\/0305-0548(93)E0014-K","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"70_CR16","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\u0131\u0301guez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2009.09.024","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"70_CR17","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). https:\/\/doi.org\/10.1109\/TEVC.2015.2507785","journal-title":"IEEE Trans. Evol. Comput."},{"key":"70_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.asoc.2017.08.020","volume":"61","author":"W Shao","year":"2017","unstructured":"Shao, W., Pi, D., Shao, Z.: An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl. Soft Comput. 61, 193\u2013210 (2017). https:\/\/doi.org\/10.1016\/j.asoc.2017.08.020","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"70_CR19","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). https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"70_CR20","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00170-003-1689-8","volume":"22","author":"L Wang","year":"2003","unstructured":"Wang, L., Zhang, L., Zheng, D.Z.: A class of order-based genetic algorithm for flow shop scheduling. Int. J. Adv. Manuf. Technol. 22(11), 828\u2013835 (2003). https:\/\/doi.org\/10.1007\/s00170-003-1689-8","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"70_CR21","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). https:\/\/doi.org\/10.1016\/j.cor.2014.10.008","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"70_CR22","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). https:\/\/doi.org\/10.1016\/j.cor.2013.09.002","journal-title":"Comput. Oper. Res."},{"key":"70_CR23","doi-asserted-by":"publisher","unstructured":"Zheng, Y.J., Zhang, B.: A simplified water wave optimization algorithm. In: IEEE Congress on Evolutionary Computation, pp. 807\u2013813 (2015).https:\/\/doi.org\/10.1109\/CEC.2015.7256974","DOI":"10.1109\/CEC.2015.7256974"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26766-7_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:30:59Z","timestamp":1710325859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26766-7_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267650","9783030267667"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26766-7_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}