{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:11:35Z","timestamp":1726038695438},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030269685"},{"type":"electronic","value":"9783030269692"}],"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-26969-2_64","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T19:09:48Z","timestamp":1564513788000},"page":"678-687","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Whale Optimization Algorithm with Local Search for Open Shop Scheduling Problem to Minimize Makespan"],"prefix":"10.1007","author":[{"given":"Hui-Min","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huai-Ping","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"4","key":"64_CR1","first-page":"284","volume":"29","author":"W Kubiak","year":"1991","unstructured":"Kubiak, W., Sriskandarajah, C., Zaras, K.: A note on the complexity of open shop scheduling problems. Inform. Syst. Oper. Res. 29(4), 284\u2013294 (1991)","journal-title":"Inform. Syst. Oper. Res."},{"issue":"2","key":"64_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.rcim.2007.07.017","volume":"25","author":"C Low","year":"2009","unstructured":"Low, C., Yeh, Y.: Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robot. Comput.-Integr. Manuf. 25(2), 314\u2013322 (2009)","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"9","key":"64_CR3","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1016\/j.cor.2008.11.009","volume":"36","author":"ME Matta","year":"2009","unstructured":"Matta, M.E.: A genetic algorithm for the proportionate multiprocessor open shop. Comput. Oper. Res. 36(9), 2601\u20132618 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"64_CR4","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1057\/jors.1994.99","volume":"45","author":"C Prins","year":"1994","unstructured":"Prins, C.: An overview of scheduling problems arising in satellite communications. J. Oper. Res. Soc. 45(6), 611\u2013623 (1994)","journal-title":"J. Oper. Res. Soc."},{"issue":"14","key":"64_CR5","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1016\/S0305-0548(02)00124-7","volume":"30","author":"CF Liaw","year":"2003","unstructured":"Liaw, C.F.: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Comput. Oper. Res. 30(14), 2081\u20132095 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"64_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"TF Gonzalez","year":"1976","unstructured":"Gonzalez, T.F., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665\u2013679 (1976)","journal-title":"J. ACM"},{"issue":"1\u20133","key":"64_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jurisch, B., Wostmann, B.: A branch and bound algorithm for the open shop problem. Discrete Appl. Math. 76(1\u20133), 43\u201359 (1997)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"64_CR8","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"64_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","volume":"26","author":"CF Liaw","year":"1999","unstructured":"Liaw, C.F.: A tabu search algorithm for the open shop scheduling problem. Comput. Oper. Res. 26(2), 109\u2013126 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"64_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s001860000090","volume":"52","author":"C Prins","year":"2000","unstructured":"Prins, C.: Competitive genetic algorithms for the open-shop scheduling problem. Math. Methods Oper. Res. 52(3), 389\u2013411 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"10","key":"64_CR11","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","volume":"35","author":"DY Sha","year":"2008","unstructured":"Sha, D.Y., Hsu, C.Y.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243\u20133261 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"64_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.3901\/JME.2006.02.129","volume":"42","author":"L Gao","year":"2006","unstructured":"Gao, L., Gao, H.B., Zhou, C.: Open shop scheduling based on particle swarm optimization. J. Mech. Eng. 42(2), 129\u2013134 (2006)","journal-title":"J. Mech. Eng."},{"key":"64_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"issue":"04","key":"64_CR14","first-page":"1","volume":"36","author":"X Yan","year":"2019","unstructured":"Yan, X., Ye, C.M., Yao, Y.Y.: Solving job-shop scheduling problem by quantum whale optimization algorithm. Appl. Res. Comput. 36(04), 1\u20132 (2019)","journal-title":"Appl. Res. Comput."},{"key":"64_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset, M., Gunasekaran, M., El-Shahat, D., et al.: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85, 129\u2013145 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"64_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-24728-6_81","volume-title":"Advanced Intelligent Computing","author":"B Qian","year":"2011","unstructured":"Qian, B., Zhou, H.-B., Hu, R., Xiang, F.-H.: Hybrid Differential evolution optimization for no-wait flow-shop scheduling with sequence-dependent setup times and release dates. In: Huang, D.-S., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2011. LNCS, vol. 6838, pp. 600\u2013611. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-24728-6_81"},{"issue":"4","key":"64_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Oper. Res. 8(4), 487\u2013503 (1960)","journal-title":"Oper. Res."},{"issue":"15","key":"64_CR18","doi-asserted-by":"publisher","first-page":"4657","DOI":"10.1080\/00207543.2010.497174","volume":"49","author":"B Naderi","year":"2011","unstructured":"Naderi, B., Ghomi, S.M.T.F., Aminnayeri, M., et al.: A study on open shop scheduling to minimise total tardiness. Int. J. Prod. Res. 49(15), 4657\u20134678 (2011)","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26969-2_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T19:21:06Z","timestamp":1564514466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26969-2_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030269685","9783030269692"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26969-2_64","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"}}]}}