{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:03:37Z","timestamp":1729677817631,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/cluster.2012.18","type":"proceedings-article","created":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T17:47:02Z","timestamp":1351273622000},"page":"10-17","source":"Crossref","is-referenced-by-count":21,"title":["A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem"],"prefix":"10.1109","author":[{"given":"N.","family":"Melab","sequence":"first","affiliation":[]},{"given":"I.","family":"Chakroun","sequence":"additional","affiliation":[]},{"given":"M.","family":"Mezmaz","sequence":"additional","affiliation":[]},{"given":"D.","family":"Tuyttens","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"19"},{"year":"0","key":"22"},{"journal-title":"NVIDIA CUDA C Programming Best Practices Guide","year":"0","key":"17"},{"year":"0","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09707-7_8"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-011-0594-4"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.337"},{"journal-title":"IEEE Transactions on Computers","article-title":"GPU Computing for Parallel Local Search Metaheuristic Algorithms","year":"2012","author":"luong","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370217"},{"journal-title":"Pthreads Programming","year":"1996","author":"nichols","key":"12"},{"year":"0","key":"21"},{"key":"3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A general bounding scheme for the permutation flow-shop problem","volume":"26","author":"lageweg","year":"1978","journal-title":"Operations Research"},{"year":"0","key":"20"},{"volume":"10","journal-title":"Using OpenMP Portable Shared Memory Parallel Programming","year":"2007","author":"chapman","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.6.1042"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/256\/1\/012018"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1995.395930"},{"journal-title":"Taillard's FSP Benchmarks","year":"0","author":"taillard","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802086300"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/71.598276"}],"event":{"name":"2012 IEEE International Conference on Cluster Computing (CLUSTER)","start":{"date-parts":[[2012,9,24]]},"location":"Beijing, China","end":{"date-parts":[[2012,9,28]]}},"container-title":["2012 IEEE International Conference on Cluster Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6336636\/6337766\/06337851.pdf?arnumber=6337851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T21:56:50Z","timestamp":1497995810000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6337851\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cluster.2012.18","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}
