{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:18:23Z","timestamp":1730222303501,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/fskd.2017.8393402","type":"proceedings-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T18:38:33Z","timestamp":1531766313000},"page":"930-934","source":"Crossref","is-referenced-by-count":0,"title":["An effective fruit fly optimization algorithm for the hybrid flowshop scheduling problem"],"prefix":"10.1109","author":[{"given":"Jun-hua","family":"Duan","sequence":"first","affiliation":[]},{"given":"Tao","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Quan-ke","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Qing-da","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47926-1_41"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.01.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2444383"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2000103","article-title":"An exact method for solving the multiprocessor flowshop","volume":"34","author":"carlier","year":"2000","journal-title":"R A I R O Operations Research"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.01.011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0257-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.07.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2425404"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-017-0699-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2240304"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1988.63"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1051\/ro:1999108","article-title":"Les problèmes d'ordonnancement de type flow-shop hybride: état de l'art","volume":"33","author":"vignier","year":"1999","journal-title":"RAIRO Recherche Oprationnelle"},{"key":"ref8","first-page":"1","article-title":"A GRASP meta-heuristic for the hybrid flowshop scheduling problem","author":"gonz\u00e1lezneira","year":"2017","journal-title":"Journal of Decision System"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00260-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2013.12.004"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","article-title":"Using ant colony optimization to solve hybrid flow shop scheduling problems","volume":"35","author":"alaykyran","year":"2007","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.11.022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.01.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.04.003"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1007\/s00500-015-1641-5","article-title":"An improved fruit fly optimization algorithm to solve the homogeneous fuzzy series-parallel redundancy allocation problem under discount strategies","volume":"20","author":"mousavi","year":"2016","journal-title":"Soft Computing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.03.003"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.asoc.2016.11.023","article-title":"An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem","volume":"50","author":"meng","year":"2017","journal-title":"Applied Soft Computing"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00170-011-3197-6","article-title":"Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion","volume":"56","author":"gao","year":"2011","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.025"}],"event":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","start":{"date-parts":[[2017,7,29]]},"location":"Guilin","end":{"date-parts":[[2017,7,31]]}},"container-title":["2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8384043\/8392854\/08393402.pdf?arnumber=8393402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T01:56:19Z","timestamp":1598234179000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8393402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/fskd.2017.8393402","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}