{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:04:42Z","timestamp":1743087882341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030299101"},{"type":"electronic","value":"9783030299118"}],"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-29911-8_29","type":"book-chapter","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T01:03:32Z","timestamp":1566522212000},"page":"379-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Setup Time Constraints in Local Search for Flowshop Scheduling"],"prefix":"10.1007","author":[{"given":"Vahid","family":"Riahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A. Hakim","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246(2), 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","volume":"227","author":"M Ciavotta","year":"2013","unstructured":"Ciavotta, M., Minella, G., Ruiz, R.: Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study. Eur. J. Oper. Res. 227(2), 301\u2013313 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"29_CR3","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":"29_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","volume":"24","author":"JN Gupta","year":"1986","unstructured":"Gupta, J.N., Darrow, W.P.: The two-machine sequence dependent flowshop scheduling problem. Eur. J. Oper. Res. 24(3), 439\u2013446 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Ince, Y., Karabulut, K., Tasgetiren, M.F., Pan, Q.K.: A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 3401\u20133408. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744220"},{"key":"29_CR6","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"2017","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments. Wiley, New York (2017)"},{"issue":"1","key":"29_CR7","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 Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"QK Pan","year":"2012","unstructured":"Pan, Q.K., Ruiz, R.: Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1), 31\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"29_CR9","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)","journal-title":"Comput. Ind. Eng."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2017.02.027","volume":"79","author":"V Riahi","year":"2017","unstructured":"Riahi, V., Khorramizadeh, M., Newton, M.H., Sattar, A.: Scatter search for mixed blocking flowshop scheduling. Expert Syst. Appl. 79, 20\u201332 (2017)","journal-title":"Expert Syst. Appl."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Riahi, V., Newton, M.H., Su, K., Sattar, A.: Local search for flowshops with setup times and blocking constraints. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 199\u2013207 (2018)","DOI":"10.1609\/icaps.v28i1.13895"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2018.10.003","volume":"102","author":"V Riahi","year":"2019","unstructured":"Riahi, V., Newton, M.H., Su, K., Sattar, A.: Constraint guided accelerated search for mixed blocking permutation flowshop scheduling. Comput. Oper. Res. 102, 102\u2013120 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2004.01.022","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 165(1), 34\u201354 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz, R., St\u00fctzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3), 1143\u20131159 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.swevo.2017.12.005","volume":"40","author":"Z Shao","year":"2018","unstructured":"Shao, Z., Pi, D., Shao, W.: A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 40, 53\u201375 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2017.06.027","volume":"264","author":"A Sioud","year":"2018","unstructured":"Sioud, A., Gagn\u00e9, C.: Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur. J. Oper. Res. 264(1), 66\u201373 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2019: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29911-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T11:02:53Z","timestamp":1695121373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29911-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299101","9783030299118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29911-8_29","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":"23 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuvu, Yanuka Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","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":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}