{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:27:51Z","timestamp":1762957671584,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031901997","type":"print"},{"value":"9783031902000","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-90200-0_37","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:33Z","timestamp":1749573753000},"page":"463-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Chapel-Based Multi-GPU Branch-and-Bound Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8697-3721","authenticated-orcid":false,"given":"Guillaume","family":"Helbecque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1971-4973","authenticated-orcid":false,"given":"Ezhilmathi","family":"Krishnasamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiago","family":"Carneiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"issue":"5","key":"37_CR1","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"37_CR2","unstructured":"Carneiro, T., Melab, N., Hayashi, A., Sarkar, V.: Towards chapel-based exascale tree search algorithms: dealing with multiple GPU accelerators. In: 18th International Conference on High Performance Computing & Simulation (2021)"},{"issue":"8","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1002\/cpe.2931","volume":"25","author":"I Chakroun","year":"2013","unstructured":"Chakroun, I., Mezmaz, M., Melab, N., Bendjoudi, A.: Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm. Concurrency Comput. Pract. Experience 25(8), 1121\u20131136 (2013)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"37_CR4","unstructured":"Chamberlain, B.L., et al.: Chapel comes of age: making scalable programming productive (2018)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Dabah, A., Bendjoudi, A., El-Baz, D., Aitzai, A.: GPU-based two level parallel B &B for the blocking job shop scheduling problem. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 747\u2013755 (2016)","DOI":"10.1109\/IPDPSW.2016.14"},{"issue":"2","key":"37_CR6","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":"6","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.G.: Parallel branch-and-branch algorithms: survey and synthesis. Oper. Res. 42(6), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"issue":"9","key":"37_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4019","volume":"29","author":"J Gmys","year":"2017","unstructured":"Gmys, J., Mezmaz, M., Melab, N., Tuyttens, D.: IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. Concurrency Comput. Pract. Experience 29(9), e4019 (2017)","journal-title":"Concurrency Comput. Pract. Experience"},{"issue":"5","key":"37_CR9","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1287\/ijoc.2022.1193","volume":"34","author":"J Gmys","year":"2022","unstructured":"Gmys, J.: Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers. INFORMS J. Comput. 34(5), 2502\u20132522 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"37_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","volume":"7","author":"A Grama","year":"1995","unstructured":"Grama, A., Kumar, V.: Parallel search algorithms for discrete optimization problems. ORSA J. Comput. 7(4), 365\u2013385 (1995)","journal-title":"ORSA J. Comput."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Helbecque, G., Krishnasamy, E., Carneiro, T., Melab, N., Bouvry, P.: GPU-accelerated tree-search in Chapel (2024). https:\/\/github.com\/Guillaume-Helbecque\/GPU-accelerated-tree-search-Chapel","DOI":"10.1109\/IPDPSW63119.2024.00156"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Helbecque, G., Krishnasamy, E., Melab, N., Bouvry, P.: GPU-accelerated tree-search in chapel versus CUDA and HIP. In: 2024 IEEE International Parallel and Distributed Processing Symposium Workshops (2024)","DOI":"10.1109\/IPDPSW63119.2024.00156"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Lageweg, B.J., Lenstra, J.K., Rinnooy\u00a0Kan, A.H.G.: A general bounding scheme for the permutation flow-shop problem. Oper. Res. 26(1), 53\u201367 (1978)","DOI":"10.1287\/opre.26.1.53"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Lalami, M.E., El-Baz, D.: GPU implementation of the branch and bound method for knapsack problems. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp. 1769\u20131777 (2012)","DOI":"10.1109\/IPDPSW.2012.219"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Melab, N., Chakroun, I., Mezmaz, M., Tuyttens, D.: A GPU-accelerated branch-and-bound algorithm for the flow-shop scheduling problem. In: 2012 IEEE International Conference on Cluster Computing, pp. 10\u201317 (2012)","DOI":"10.1109\/CLUSTER.2012.18"},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.future.2015.10.009","volume":"56","author":"TT Vu","year":"2016","unstructured":"Vu, T.T., Derbel, B.: Parallel branch-and-bound in multi-core multi-CPU multi-GPU heterogeneous environments. Futur. Gener. Comput. Syst. 56, 95\u2013109 (2016)","journal-title":"Futur. Gener. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90200-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:35Z","timestamp":1749573755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90200-0_37"}},"subtitle":["Application to the Flowshop Scheduling Problem"],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031901997","9783031902000"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90200-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"11 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}