{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:09:50Z","timestamp":1730297390957,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/snpd.2018.8441112","type":"proceedings-article","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T18:08:40Z","timestamp":1535047720000},"page":"117-122","source":"Crossref","is-referenced-by-count":1,"title":["Acceleration of a CUDA-Based Hybrid Genetic Algorithm and its Application to a Flexible Flow Shop Scheduling Problem"],"prefix":"10.1109","author":[{"given":"Jia","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier El","family":"Baz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinglu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"573","article-title":"A paralleled genetic algorithm based on a neighborhood model and its application to the jobshop scheduling","volume":"2","author":"tamaki","year":"1992","journal-title":"Parallel Problem Solving from Nature"},{"key":"ref11","first-page":"130","article-title":"A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves","volume":"14","author":"ghosn","year":"2016","journal-title":"Artific Intellig Int J"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12239-2_46"},{"key":"ref13","first-page":"24","article-title":"Implementation of parallel genetic algorithm based on CUDA","author":"zhang","year":"2009","journal-title":"The 4th International Symposium on Intelligence Computation and Applications"},{"journal-title":"Parallel CPU and GPU computations to solve the job shop scheduling problem with blocking","year":"2013","author":"ait zai","key":"ref14"},{"key":"ref15","article-title":"Accelerating a Flow Shop Scheduling Algorithm on the GPU","volume":"143","author":"zajicek","year":"2011","journal-title":"eraerts"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirp.2012.03.084"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-017-0509-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018912715283"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014827"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICAETR.2014.7012818"},{"journal-title":"Nvidia","year":"2017","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(03)00077-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.45"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-009-9091-4"},{"key":"ref2","first-page":"141","article-title":"A survey of parallel genetic algorithms","volume":"10","author":"cant\u00fa-paz","year":"1998","journal-title":"Calculateurs Paralleles Reseaux et Systems Repartis"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"holland","year":"1992","journal-title":"Genetic Algorithms Scientific American"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.protcy.2012.02.073","article-title":"Solving flow shop scheduling problem using a parallel genetic algorithm","volume":"1","author":"akhshabi","year":"2012","journal-title":"Procedia Technology"}],"event":{"name":"2018 19th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD)","start":{"date-parts":[[2018,6,27]]},"location":"Busan","end":{"date-parts":[[2018,6,29]]}},"container-title":["2018 19th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8422066\/8441025\/08441112.pdf?arnumber=8441112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T11:25:56Z","timestamp":1643196356000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8441112\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/snpd.2018.8441112","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}