{"id":"https://openalex.org/W2480734887","doi":"https://doi.org/10.1109/hpcsim.2016.7568414","title":"Efficient parallel B&B method for the blocking job shop scheduling problem","display_name":"Efficient parallel B&B method for the blocking job shop scheduling problem","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2480734887","doi":"https://doi.org/10.1109/hpcsim.2016.7568414","mag":"2480734887"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2016.7568414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015776910","display_name":"Adel Dabah","orcid":"https://orcid.org/0000-0001-9175-469X"},"institutions":[{"id":"https://openalex.org/I4210095777","display_name":"Centre de Recherche sur l'Information Scientifique et Technique","ror":"https://ror.org/01k1bte55","country_code":"DZ","type":"government","lineage":["https://openalex.org/I4210095777","https://openalex.org/I4210114810"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Adel Dabah","raw_affiliation_strings":["CERIST Research Center Algiers, Algeria University of Sciences and Technology Houari Boumedienne Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"CERIST Research Center Algiers, Algeria University of Sciences and Technology Houari Boumedienne Algiers, Algeria","institution_ids":["https://openalex.org/I4210095777"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015208242","display_name":"Ahc\u00e8ne Bendjoudi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095777","display_name":"Centre de Recherche sur l'Information Scientifique et Technique","ror":"https://ror.org/01k1bte55","country_code":"DZ","type":"government","lineage":["https://openalex.org/I4210095777","https://openalex.org/I4210114810"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Ahcene Bendjoudi","raw_affiliation_strings":["CERIST Research Center Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"CERIST Research Center Algiers, Algeria","institution_ids":["https://openalex.org/I4210095777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091341388","display_name":"Abdelhakim AitZai","orcid":null},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdelhakim AitZai","raw_affiliation_strings":["University of Sciences and Technology Houari Boumedienne Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"University of Sciences and Technology Houari Boumedienne Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015776910"],"corresponding_institution_ids":["https://openalex.org/I4210095777"],"apc_list":null,"apc_paid":null,"fwci":1.2535,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82773297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"784","last_page":"791"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8028556108474731},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7589203715324402},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6784981489181519},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6557270884513855},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6178549528121948},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5883485078811646},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5677987337112427},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5590664744377136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5254527926445007},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.48487600684165955},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4246599078178406},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4161240756511688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2410098910331726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1261577308177948},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.11965674161911011},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09155100584030151}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8028556108474731},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7589203715324402},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6784981489181519},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6557270884513855},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6178549528121948},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5883485078811646},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5677987337112427},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5590664744377136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5254527926445007},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.48487600684165955},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4246599078178406},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4161240756511688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2410098910331726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1261577308177948},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.11965674161911011},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09155100584030151},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2016.7568414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W24604221","https://openalex.org/W123017245","https://openalex.org/W1573128395","https://openalex.org/W1580458916","https://openalex.org/W1630886508","https://openalex.org/W2015465419","https://openalex.org/W2020459421","https://openalex.org/W2028826326","https://openalex.org/W2028900733","https://openalex.org/W2058920015","https://openalex.org/W2060032012","https://openalex.org/W2066061987","https://openalex.org/W2067814550","https://openalex.org/W2077266619","https://openalex.org/W2117400912","https://openalex.org/W2124396367","https://openalex.org/W2149884725","https://openalex.org/W2341350247","https://openalex.org/W4231436342","https://openalex.org/W6634238093","https://openalex.org/W6636682316","https://openalex.org/W6669516415"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2092966558","https://openalex.org/W1956651153","https://openalex.org/W1984267569","https://openalex.org/W2347561926","https://openalex.org/W2315766899","https://openalex.org/W2327547880","https://openalex.org/W2002944882","https://openalex.org/W3153517983","https://openalex.org/W210339300"],"abstract_inverted_index":{"The":[0,32,106,125,164,182],"blocking":[1],"job":[2,13],"shop":[3,14],"scheduling":[4,15],"problem":[5],"(BJSS)":[6],"is":[7,23,111],"a":[8,63,90,128,142,149,157,171,186],"version":[9],"of":[10,35,53,66,75,83,135,152,160,189],"the":[11,29,36,40,46,50,73,76,81,114,118,139,161,190,215],"classical":[12],"with":[16,178,193],"no":[17],"intermediate":[18],"buffer":[19],"between":[20],"machines.":[21],"It":[22],"known":[24],"to":[25,44,55,62,71,97,131,147,200],"be":[26],"NP-hard":[27],"in":[28,87,145],"strong":[30],"sense.":[31],"major":[33],"drawbacks":[34],"previous":[37],"works":[38],"are":[39],"huge":[41],"time":[42,192],"needed":[43],"explore":[45],"search":[47,77],"space":[48,78],"and":[49,79,93],"low":[51],"ratio":[52],"feasible":[54,153],"explored":[56],"solutions":[57,217],"when":[58],"applying":[59],"metaheuristics,":[60,84],"leading":[61],"poor":[64],"quality":[65],"final":[67],"solutions.":[68],"In":[69],"order":[70,146],"accelerate":[72],"exploration":[74,130,144],"overcome":[80],"drawback":[82],"we":[85],"propose":[86],"this":[88],"paper":[89],"parallel":[91,108],"Branch":[92],"Bound":[94],"(B&B)":[95],"algorithm":[96],"act":[98],"both":[99],"as":[100],"an":[101],"exact":[102],"or":[103],"approximate":[104],"methods.":[105],"proposed":[107,165,212],"B&B":[109],"approach":[110,166,213],"based":[112,173],"on":[113,170],"master-worker":[115],"paradigm,":[116],"exploiting":[117],"computing":[119],"power":[120],"offered":[121],"by":[122],"cluster":[123,172],"architectures.":[124],"master":[126],"performs":[127],"breadth-first":[129],"ensure":[132],"high":[133],"availability":[134],"tasks":[136],"(sub-problems)":[137],"while":[138],"workers":[140],"perform":[141],"depth-first":[143],"browse":[148],"large":[150],"number":[151],"solutions,":[154],"therefore,":[155],"obtaining":[156],"faster":[158],"improvement":[159],"solution":[162],"quality.":[163],"has":[167],"been":[168,198],"executed":[169],"architecture":[174],"using":[175],"32":[176],"nodes":[177],"16":[179],"CPU-cores":[180],"each.":[181],"obtained":[183],"results":[184],"show":[185],"good":[187],"speedup":[188],"execution":[191],"80%":[194],"efficiency.":[195],"We":[196],"have":[197],"able":[199],"solve":[201],"optimally":[202],"ten":[203],"BJSS":[204],"benchmark":[205,222],"instances":[206],"never":[207],"solved":[208],"before.":[209],"Moreover,":[210],"our":[211],"improved":[214],"best":[216],"for":[218],"more":[219],"than":[220],"22":[221],"instances.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}