{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:59:31Z","timestamp":1743094771812,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030167103"},{"type":"electronic","value":"9783030167110"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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-16711-0_4","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"50-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3963-0467","authenticated-orcid":false,"given":"Hoang Thanh","family":"Le","sequence":"first","affiliation":[]},{"given":"Philine","family":"Geser","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5426-1092","authenticated-orcid":false,"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"issue":"C","key":"4_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.asoc.2014.11.022","volume":"28","author":"S Abdollahpour","year":"2015","unstructured":"Abdollahpour, S., Rezaeian, J.: Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system. Appl. Soft Comput. 28(C), 44\u201356 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10951-013-0340-2","volume":"17","author":"MA Aloulou","year":"2014","unstructured":"Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17\u201329 (2014)","journal-title":"J. Sched."},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00291-003-0133-7","volume":"25","author":"P Brucker","year":"2003","unstructured":"Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. Oper. Res. Spektrum 25(4), 549\u2013574 (2003)","journal-title":"Oper. Res. Spektrum"},{"key":"4_CR4","first-page":"333","volume":"12","author":"J Carlier","year":"1978","unstructured":"Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle 12, 333\u2013351 (1978)","journal-title":"R.A.I.R.O. Recherche operationelle"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas, V., Framinan, J.M.: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput. Oper. Res. 60, 27\u201336 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.orl.2015.12.012","volume":"44","author":"J Fung","year":"2016","unstructured":"Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153\u2013157 (2016)","journal-title":"Oper. Res. Lett."},{"key":"4_CR7","unstructured":"Geser, P.: Zur Komplexit\u00e4t des 2-Maschinen-Flow-Shop-Problems mit Zwischenspeicher. Diploma thesis, Leipzig University (2017)"},{"issue":"5","key":"4_CR8","first-page":"1984","volume":"215","author":"YC Hsieh","year":"2009","unstructured":"Hsieh, Y.C., You, P.S., Liou, C.D.: A note of using effective immune based approach for the flow shop scheduling with buffers. Appl. Math. Comput. 215(5), 1984\u20131989 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61\u201368 (1954)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"PA Kononova","year":"2013","unstructured":"Kononova, P.A., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54\u201367 (2013)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10845-005-1658-1","volume":"16","author":"S Li","year":"2005","unstructured":"Li, S., Tang, L.: A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage. J. Intell. Manuf. 16(4), 463\u2013477 (2005)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.cor.2008.01.002","volume":"36","author":"FC Lin","year":"2009","unstructured":"Lin, F.C., Hong, J.S., Lin, B.M.T.: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158\u20131175 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"4_CR13","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B Liu","year":"2008","unstructured":"Liu, B., Wang, L., Jin, Y.H.: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 35(9), 2791\u20132806 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ijpe.2008.11.007","volume":"117","author":"SQ Liu","year":"2009","unstructured":"Liu, S.Q., Kozan, E.: Scheduling a flow-shop with combined buffer conditions. Int. J. Prod. Econ. 117(2), 371\u2013380 (2009)","journal-title":"Int. J. Prod. Econ."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","volume":"193","author":"W Liu","year":"2017","unstructured":"Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193, 21\u201330 (2017)","journal-title":"Int. J. Prod. Econ."},{"key":"4_CR16","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ejor.2004.08.046","volume":"169","author":"S Martinez","year":"2006","unstructured":"Martinez, S., Dauz\u00e8re-P\u00e9r\u00e8s, S., Gu\u00e9ret, C., Mati, Y., Sauer, N.: Complexity of flowshop scheduling problems with a new blocking constraint. Eur. J. Oper. Res. 169, 855\u2013864 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","volume":"52","author":"G Moslehi","year":"2014","unstructured":"Moslehi, G., Khorasanian, D.: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. Comput. Oper. Res. 52, 260\u2013268 (2014)","journal-title":"Comput. Oper. Res."},{"key":"4_CR19","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, 91\u201395 (1983)","journal-title":"Omega"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"5270","DOI":"10.1016\/j.asoc.2011.05.033","volume":"11","author":"QK Pan","year":"2011","unstructured":"Pan, Q.K., Wang, L., Gao, L.: A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl. Soft Comput. 11, 5270\u20135280 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.ins.2010.10.009","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan, Q.K., Wang, L., Gao, L., Li, W.D.: An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf. Sci. 181(3), 668\u2013685 (2011)","journal-title":"Inf. Sci."},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"CH Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. J. Assoc. Comput. Mach. (JACM) 27(3), 533\u2013549 (1980)","journal-title":"J. Assoc. Comput. Mach. (JACM)"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C Reeves","year":"1995","unstructured":"Reeves, C.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5\u201313 (1995)","journal-title":"Comput. Oper. Res."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Sang, H.Y., Pan, Q.K.: An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers. In: 25th Chinese Control and Decision Conference (CCDC), pp. 861\u2013864 (2013)","DOI":"10.1109\/CCDC.2013.6561043"},{"key":"4_CR25","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, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240, 666\u2013677 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1057\/jors.2010.132","volume":"62","author":"JA V\u00e1zquez-Rodr\u00edguez","year":"2011","unstructured":"V\u00e1zquez-Rodr\u00edguez, J.A., Ochoa, G.: On the automatic discovery of variants of the neh procedure for flow shop scheduling using genetic programming. J. Oper. Res. Soc. 62(2), 381\u2013396 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"2960","DOI":"10.1016\/j.cor.2005.02.028","volume":"33","author":"L Wang","year":"2006","unstructured":"Wang, L., Zhang, L., Zheng, D.Z.: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 33, 2960\u20132971 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCI.2014.2326101","volume":"9","author":"T Weise","year":"2014","unstructured":"Weise, T., Chiong, R., Lassig, J., Tang, K., Tsutsui, S., Chen, W., Michalewicz, Z., Yao, X.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3), 40\u201352 (2014)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"9","key":"4_CR30","doi-asserted-by":"publisher","first-page":"3471","DOI":"10.1007\/s11771-015-2887-x","volume":"22","author":"SJ Zhang","year":"2015","unstructured":"Zhang, S.J., Gu, X.S.: An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers. J. Central South Univ. 22(9), 3471\u20133484 (2015)","journal-title":"J. Central South Univ."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16711-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:34:39Z","timestamp":1709814879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16711-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167103","9783030167110"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16711-0_4","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":"28 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}