{"id":"https://openalex.org/W4283118305","doi":"https://doi.org/10.1145/3547276.3548633","title":"Parallel Beam Search for Combinatorial Optimization","display_name":"Parallel Beam Search for Combinatorial Optimization","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4283118305","doi":"https://doi.org/10.1145/3547276.3548633"},"language":"en","primary_location":{"id":"doi:10.1145/3547276.3548633","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547276.3548633","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547276.3548633","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3547276.3548633","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015931756","display_name":"Nikolaus Frohner","orcid":"https://orcid.org/0000-0002-0629-9379"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nikolaus Frohner","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076242888","display_name":"Jan Gmys","orcid":"https://orcid.org/0000-0001-9635-4396"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jan Gmys","raw_affiliation_strings":["University of Lille, France and INRIA Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lille, France and INRIA Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112866837","display_name":"Nouredine Melab","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nouredine Melab","raw_affiliation_strings":["University of Lille, France and INRIA Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lille, France and INRIA Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G\u00fcnther Raidl","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114031934","display_name":"El\u2010Ghazali Talbi","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"El-Ghazali Talbi","raw_affiliation_strings":["University of Lille, France and INRIA Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lille, France and INRIA Lille, France","institution_ids":["https://openalex.org/I2279609970","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.271,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.60800586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9975000023841858,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"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.7566813230514526},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6310853362083435},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5158511996269226},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4934729337692261},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4860275387763977},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.477303147315979},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.47507327795028687},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4582883417606354},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4425993263721466},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.435477614402771},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4267062544822693},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4121236801147461},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35284000635147095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34786978363990784},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2386314570903778},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1636194884777069}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7566813230514526},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6310853362083435},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5158511996269226},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4934729337692261},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4860275387763977},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.477303147315979},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.47507327795028687},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4582883417606354},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4425993263721466},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.435477614402771},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4267062544822693},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4121236801147461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35284000635147095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34786978363990784},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2386314570903778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1636194884777069},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3547276.3548633","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547276.3548633","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547276.3548633","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03773423v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-03773423","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Workshop on Parallel and Distributed Algorithms and Decision Sciences (PDADS 2022), Aug 2022, Bordeaux, France","raw_type":"Conference papers"},{"id":"pmh:oai:lilloa.univ-lille.fr:20.500.12210/74782","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12210/74782","pdf_url":null,"source":{"id":"https://openalex.org/S4306402203","display_name":"LillOA (Universit\u00e9 de Lille (University Of Lille))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210123514","host_organization_name":"Centre d'Etudes en Civilisations, Langues et Litt\u00e9ratures Etrang\u00e8res","host_organization_lineage":["https://openalex.org/I4210123514"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3547276.3548633","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547276.3548633","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547276.3548633","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4699999988079071,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G4747624297","display_name":null,"funder_award_id":"W1260-N35","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7604315338","display_name":"Vienna Graduate School on Computational Optimization","funder_award_id":"W1260","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320322839","display_name":"Technische Universit\u00e4t Wien","ror":"https://ror.org/04d836q62"},{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4283118305.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1601564682","https://openalex.org/W1983834134","https://openalex.org/W2063345867","https://openalex.org/W2069323107","https://openalex.org/W2071241868","https://openalex.org/W2100233978","https://openalex.org/W2150871235","https://openalex.org/W2156391157","https://openalex.org/W2169521001","https://openalex.org/W3001967193","https://openalex.org/W3016075270","https://openalex.org/W3215559149","https://openalex.org/W4224277325"],"related_works":["https://openalex.org/W48124421","https://openalex.org/W2293223786","https://openalex.org/W2120739134","https://openalex.org/W3001750164","https://openalex.org/W2184426101","https://openalex.org/W2181425632","https://openalex.org/W2952782208","https://openalex.org/W1676753661","https://openalex.org/W2951478555","https://openalex.org/W1602826054"],"abstract_inverted_index":{"Inspired":[0],"by":[1,37,67,78],"the":[2,101,132],"recent":[3],"success":[4],"of":[5,47,168],"parallelized":[6],"exact":[7],"methods":[8],"to":[9,50,140,146,160],"solve":[10],"difficult":[11,119,155],"scheduling":[12],"problems,":[13,121],"we":[14],"present":[15],"a":[16,29,33,44,59],"general":[17],"parallel":[18],"beam":[19,95,143],"search":[20,27,34],"framework":[21],"for":[22,64,117,153],"combinatorial":[23],"optimization":[24],"problems.":[25],"Beam":[26],"is":[28,62],"constructive":[30],"metaheuristic":[31],"traversing":[32],"tree":[35],"layer":[36,38,43],"while":[39],"keeping":[40],"in":[41,55,100],"each":[42],"bounded":[45],"number":[46],"promising":[48],"nodes":[49],"consider":[51],"many":[52],"partial":[53],"solutions":[54,152],"parallel.":[56],"We":[57],"propose":[58],"variant":[60],"which":[61],"suitable":[63],"intra-node":[65],"parallelization":[66,75],"multithreading":[68],"with":[69,113,128,163],"data":[70],"parallelism.":[71],"Diversification":[72],"and":[73,94,131],"inter-node":[74],"are":[76],"combined":[77],"performing":[79],"multiple":[80],"randomized":[81],"runs":[82,145],"on":[83,110],"independent":[84],"workers":[85],"communicating":[86],"via":[87],"MPI.":[88],"For":[89],"sufficiently":[90],"large":[91,142],"problem":[92],"instances":[93,158],"widths":[96],"our":[97],"prototypical":[98],"implementation":[99],"JIT-compiled":[102],"Julia":[103],"language":[104],"admits":[105],"speed-ups":[106],"between":[107],"30\u201342":[108],"\u00d7":[109],"46":[111],"cores":[112],"uniform":[114],"memory":[115],"access":[116],"two":[118],"classical":[120],"namely":[122],"Permutation":[123],"Flow":[124],"Shop":[125],"Scheduling":[126],"(PFSP)":[127],"flowtime":[129],"objective":[130],"Traveling":[133],"Tournament":[134],"Problem":[135],"(TTP).":[136],"This":[137],"allowed":[138],"us":[139],"perform":[141],"width":[144],"find":[147],"11":[148],"new":[149],"best":[150],"feasible":[151],"22":[154],"TTP":[156],"benchmark":[157],"up":[159],"20":[161],"teams":[162],"an":[164],"average":[165],"wallclock":[166],"runtime":[167],"about":[169],"one":[170],"hour":[171],"per":[172],"instance.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}