{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:33:27Z","timestamp":1769841207674,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100007065","name":"Nvidia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.jpdc.2018.02.005","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T02:51:18Z","timestamp":1519613478000},"page":"73-86","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Hybrid multi-core CPU and GPU-based B&B approaches for the blocking job shop scheduling problem"],"prefix":"10.1016","volume":"117","author":[{"given":"Adel","family":"Dabah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahc\u00e8ne","family":"Bendjoudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelhakim","family":"AitZai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"El-Baz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia Nouali","family":"Taboudjemat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.jpdc.2018.02.005_b1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1504\/IJOR.2012.047094","article-title":"A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking","volume":"14","author":"AitZai","year":"2012","journal-title":"Int. J. Oper. Res."},{"key":"10.1016\/j.jpdc.2018.02.005_b2","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","article-title":"A local search genetic algorithm for the job shop scheduling problem with intelligent agents","volume":"85","author":"Asadzadeh","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.jpdc.2018.02.005_b3","series-title":"High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), 2013 IEEE 10th International Conference on","first-page":"914","article-title":"Parallel B&B algorithm for hybrid multi-core\/GPU architectures","author":"Bendjoudi","year":"2013"},{"key":"10.1016\/j.jpdc.2018.02.005_b4","series-title":"Scheduling Algorithms","author":"Brucker","year":"2007"},{"issue":"2","key":"10.1016\/j.jpdc.2018.02.005_b5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.jpdc.2018.02.005_b6","series-title":"Computer Architecture and High Performance Computing (SBAC-PAD), 2011 23rd International Symposium on","first-page":"41","article-title":"A new parallel schema for branch-and-bound algorithms using GPGPU","author":"Carneiro","year":"2011"},{"issue":"12","key":"10.1016\/j.jpdc.2018.02.005_b7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1016\/j.jpdc.2013.07.023","article-title":"Combining multi-core and GPU computing for solving combinatorial optimization problems","volume":"73","author":"Chakroun","year":"2013","journal-title":"J. Parallel Distrib. Comput."},{"issue":"8","key":"10.1016\/j.jpdc.2018.02.005_b8","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1002\/cpe.2931","article-title":"Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm","volume":"25","author":"Chakroun","year":"2013","journal-title":"Concurr. Comput.: Pract. Exper."},{"key":"10.1016\/j.jpdc.2018.02.005_b9","unstructured":"NVIDIA Corporation, Multi-Process service, 2012, https:\/\/2.zoppoz.workers.dev:443\/https\/docs.nvidia.com\/deploy\/pdf\/CUDA_Multi_Process_Service_Overview.pdf."},{"key":"10.1016\/j.jpdc.2018.02.005_b10","unstructured":"C. Cuda, Programming guide, 2012, https:\/\/2.zoppoz.workers.dev:443\/https\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html."},{"key":"10.1016\/j.jpdc.2018.02.005_b11","series-title":"High Performance Computing & Simulation (HPCS), 2016 International Conference on","first-page":"784","article-title":"Efficient parallel B&B method for the blocking job shop scheduling problem","author":"Dabah","year":"2016"},{"issue":"4","key":"10.1016\/j.jpdc.2018.02.005_b12","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.3934\/jimo.2017029","article-title":"An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem","volume":"13","author":"Dabah","year":"2017","journal-title":"J. Indust. Manage. Optim."},{"key":"10.1016\/j.jpdc.2018.02.005_b13","series-title":"High Performance Computing & Simulation (HPCS), 2016 International Conference on","first-page":"705","article-title":"Multi and many-core parallel B&B approaches for the blocking job shop scheduling problem","author":"Dabah","year":"2016"},{"key":"10.1016\/j.jpdc.2018.02.005_b14","series-title":"Parallel and Distributed Processing Symposium Workshops, 2016 IEEE International","first-page":"747","article-title":"GPU-based two level parallel B&B for the blocking job shop scheduling problem","author":"Dabah","year":"2016"},{"issue":"17","key":"10.1016\/j.jpdc.2018.02.005_b15","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","article-title":"A new neighborhood and tabu search for the blocking job shop","volume":"157","author":"Gr\u00f6flin","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.jpdc.2018.02.005_b16","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey of machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.jpdc.2018.02.005_b17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","article-title":"Job-shop scheduling with blocking and no-wait constraints","volume":"143","author":"Mascis","year":"2002","journal-title":"European J. Oper. Res."},{"issue":"5\u20136","key":"10.1016\/j.jpdc.2018.02.005_b18","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1023\/A:1012260622596","article-title":"A taboo search approach for deadlock-free scheduling of automated manufacturing systems","volume":"12","author":"Mati","year":"2001","journal-title":"J. Intell. Manuf."},{"issue":"16","key":"10.1016\/j.jpdc.2018.02.005_b19","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1002\/cpe.3155","article-title":"Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization","volume":"26","author":"Melab","year":"2014","journal-title":"Concurr. Comput.: Pract. Exper."},{"key":"10.1016\/j.jpdc.2018.02.005_b20","article-title":"Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems","author":"Melab","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"1\u20134","key":"10.1016\/j.jpdc.2018.02.005_b21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","article-title":"A rollout metaheuristic for job shop scheduling problems","volume":"131","author":"Meloni","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.jpdc.2018.02.005_b22","unstructured":"MPI Message passing interface forum, MPI: A Message Passing Interface Standard, Version 3.0, 2012."},{"key":"10.1016\/j.jpdc.2018.02.005_b23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.procs.2015.08.107","article-title":"Hybrid metaheuristics within a holonic multiagent model for the flexible job shop problem","volume":"60","author":"Nouri","year":"2015","journal-title":"Procedia Comput. Sci."},{"issue":"3","key":"10.1016\/j.jpdc.2018.02.005_b24","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/s10489-016-0786-y","article-title":"Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment","volume":"45","author":"Nouri","year":"2016","journal-title":"Appl. Intell."},{"key":"10.1016\/j.jpdc.2018.02.005_b25","doi-asserted-by":"crossref","unstructured":"Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen\u00a0F. Smith, Iterative improvement algorithms for the blocking job shop, in: ICAPS, 2012.","DOI":"10.1609\/icaps.v22i1.13530"},{"issue":"4","key":"10.1016\/j.jpdc.2018.02.005_b26","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","article-title":"An iterated greedy metaheuristic for the blocking job shop scheduling problem","volume":"22","author":"Pranzo","year":"2016","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.jpdc.2018.02.005_b27","first-page":"24","article-title":"Efficient branch and bound on fpgas using work stealing and instance-specific designs","volume":"10","author":"Riebler","year":"2017","journal-title":"ACM Trans. Reconfigur. Technol. Syst. (TRETS)"},{"key":"10.1016\/j.jpdc.2018.02.005_b28","article-title":"Les problemes dordonnancement avec contraintes disjonctives","volume":"9","author":"Roy","year":"1964","journal-title":"Note ds"},{"key":"10.1016\/j.jpdc.2018.02.005_b29","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1016\/j.procs.2017.05.188","article-title":"A hybrid heuristic in GPU-CPU based on scatter search for the generalized assignment problem","volume":"108","author":"Souza","year":"2017","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"10.1016\/j.jpdc.2018.02.005_b30","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.jpdc.2018.02.005_b31","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.future.2015.10.009","article-title":"Parallel branch-and-bound in multi-core multi-cpu multi-gpu heterogeneous environments","volume":"56","author":"Vu","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.jpdc.2018.02.005_b32","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jpdc.2016.12.023","article-title":"Ahybrid computing method of SpMV on CPU\u2013GPU heterogeneous computing systems","volume":"104","author":"Yang","year":"2017","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0743731518300820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0743731518300820?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T22:25:36Z","timestamp":1760048736000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731518300820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":32,"alternative-id":["S0743731518300820"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jpdc.2018.02.005","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hybrid multi-core CPU and GPU-based B&B approaches for the blocking job shop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jpdc.2018.02.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}