{"id":"https://openalex.org/W1498584408","doi":"https://doi.org/10.1109/icppw.2003.1240360","title":"A fast branch-and-bound scheme for the multiprocessor scheduling problem with communication time","display_name":"A fast branch-and-bound scheme for the multiprocessor scheduling problem with communication time","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W1498584408","doi":"https://doi.org/10.1109/icppw.2003.1240360","mag":"1498584408"},"language":"en","primary_location":{"id":"doi:10.1109/icppw.2003.1240360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2003.1240360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing Workshops, 2003. Proceedings.","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/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"S. Fujita","raw_affiliation_strings":["Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Department of Information Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089894774","display_name":"M. Masukawa","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"M. Masukawa","raw_affiliation_strings":["Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Department of Information Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056178948","display_name":"Shigeaki Tagashira","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"S. Tagashira","raw_affiliation_strings":["Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering Graduate School of Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Department of Information Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087923932"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":1.0089,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80534739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"104","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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.7673931121826172},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.730350136756897},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6942433714866638},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6715732216835022},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6142364740371704},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5941022038459778},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5789680480957031},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5643643736839294},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.48252102732658386},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.45767471194267273},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.44174686074256897},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43260428309440613},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3723703622817993},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.328704297542572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32850462198257446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.171784907579422},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.12542098760604858},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11396962404251099},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10903617739677429},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.08150473237037659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7673931121826172},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.730350136756897},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6942433714866638},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6715732216835022},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6142364740371704},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5941022038459778},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5789680480957031},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5643643736839294},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.48252102732658386},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.45767471194267273},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.44174686074256897},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43260428309440613},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3723703622817993},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.328704297542572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32850462198257446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.171784907579422},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12542098760604858},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11396962404251099},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10903617739677429},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.08150473237037659},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icppw.2003.1240360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2003.1240360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing Workshops, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1589466281","https://openalex.org/W1977590451","https://openalex.org/W2023753260","https://openalex.org/W2023859141","https://openalex.org/W2026899276","https://openalex.org/W2027077493","https://openalex.org/W2057392949","https://openalex.org/W2060160256","https://openalex.org/W2068127414","https://openalex.org/W2092333800","https://openalex.org/W2110417760","https://openalex.org/W2118396891","https://openalex.org/W2146308807","https://openalex.org/W2166627447","https://openalex.org/W2167384564","https://openalex.org/W2341350247","https://openalex.org/W4241059098","https://openalex.org/W4255182129","https://openalex.org/W4256335355","https://openalex.org/W6635230930","https://openalex.org/W6681624650","https://openalex.org/W6704141741"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1833217363","https://openalex.org/W2161267363","https://openalex.org/W2062808533","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2153689068","https://openalex.org/W2618418901"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,85],"propose":[4],"a":[5,54,131,163,171,176],"fast":[6],"branch-and-bound":[7],"(B&B)":[8],"algorithm":[9],"for":[10,74,121,143,159],"solving":[11],"the":[12,46,60,63,105,113,118,126,136,151],"multiprocessor":[13],"scheduling":[14],"problem":[15],"with":[16,170],"non-negligible":[17],"communication":[18,33,99],"time.":[19],"The":[20,48,68],"basic":[21],"idea":[22],"of":[23,43,56,62,70,79,91,107,115,139],"our":[24],"proposed":[25,49,127,152],"method":[26,50,128,153],"is":[27,51,65],"to":[28,174],"focus":[29],"on":[30],"an":[31,156],"\"inevitable\"":[32],"delay":[34],"that":[35,73,150],"could":[36,86,129,154],"not":[37],"be":[38],"avoided":[39],"in":[40,134],"any":[41,98],"assignment":[42],"tasks":[44],"onto":[45],"processors.":[47],"implemented":[52],"as":[53],"part":[55],"B&B":[57],"scheme,":[58],"and":[59,117,124],"performance":[61],"scheme":[64],"evaluated":[66],"experimentally.":[67],"result":[69],"experiments":[71],"implies":[72],"randomly":[75],"generated":[76],"instances":[77,93,109,161],"consisting":[78],"at":[80],"most":[81],"300":[82],"tasks:":[83],"1)":[84],"solve":[87],"more":[88],"than":[89],"90%":[90],"those":[92,144],"within":[94,162],"one":[95],"minute":[96],"if":[97],"takes":[100],"zero":[101],"time":[102,119,166],"unit;":[103],"2)":[104],"percentage":[106],"hard":[108,145],"increases":[110],"by":[111,167],"increasing":[112,135],"number":[114],"processors":[116],"required":[120],"each":[122],"communication;":[123],"3)":[125],"achieve":[130],"significant":[132],"improvement":[133],"lower":[137],"bound":[138],"partial":[140],"solutions":[141],"especially":[142],"instances.":[146],"Those":[147],"results":[148],"suggest":[149],"output":[155],"optimum":[157],"solution":[158],"many":[160],"short":[164],"computing":[165],"combining":[168],"it":[169],"good":[172],"heuristic":[173],"give":[175],"better":[177],"upper":[178],"bound.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}