{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:12:47Z","timestamp":1761808367452,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/ssci44817.2019.9002931","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T07:49:24Z","timestamp":1582271364000},"page":"1684-1691","source":"Crossref","is-referenced-by-count":3,"title":["A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion"],"prefix":"10.1109","author":[{"given":"Liangshan","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Fatih","family":"Tasgetiren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hande","family":"Oztop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Levent","family":"Kandiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.06.009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.12.021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(89)90059-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-007-1252-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02836-6_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.02.011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.01.005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.05.063"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.01.017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/ChiCC.2018.8483752"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2007.02.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.031"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(82)90004-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.030"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.3390\/a12050100","article-title":"A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion","volume":"12","author":"kizilay","year":"2019","journal-title":"Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800290311"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.025"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2005.05.002"},{"key":"ref2","first-page":"429","article-title":"A branch and bound algorithm for the F|noidle|Cmax","author":"baptiste","year":"1997","journal-title":"Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM’1997)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1504\/EJIE.2008.017687"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.057"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.033"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03753-0_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.08.022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11740-017-0716-9"},{"key":"ref25","first-page":"2582","article-title":"A general variable neighborhood search algorithm to minimize the makespan of the distributed permutation flowshop scheduling problem","volume":"9","author":"komaki","year":"2015","journal-title":"Int Sch Sci Res Innovation"}],"event":{"name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2019,12,6]]},"location":"Xiamen, China","end":{"date-parts":[[2019,12,9]]}},"container-title":["2019 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8975711\/9002648\/09002931.pdf?arnumber=9002931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:48:42Z","timestamp":1658094522000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9002931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/ssci44817.2019.9002931","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}