{"id":"https://openalex.org/W2146308807","doi":"https://doi.org/10.1109/icpads.2002.1183469","title":"A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem","display_name":"A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2146308807","doi":"https://doi.org/10.1109/icpads.2002.1183469","mag":"2146308807"},"language":"en","primary_location":{"id":"doi:10.1109/icpads.2002.1183469","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2002.1183469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ninth International Conference on Parallel and Distributed Systems, 2002. 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, Higashihiroshima, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashihiroshima, 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, Higashihiroshima, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashihiroshima, 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, Higashihiroshima, Japan","Department of Information Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashihiroshima, 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":4.5976,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.94237704,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"611","last_page":"616"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9962000250816345,"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/branch-and-bound","display_name":"Branch and bound","score":0.7633817791938782},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7143850326538086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7057071924209595},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6364568471908569},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5930691957473755},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5702121257781982},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49237358570098877},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4429376721382141},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43069350719451904},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4141753315925598},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39978349208831787},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.33019590377807617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2169957458972931},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.11756649613380432},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.05670937895774841}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7633817791938782},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7143850326538086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7057071924209595},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6364568471908569},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5930691957473755},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5702121257781982},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49237358570098877},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4429376721382141},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43069350719451904},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4141753315925598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39978349208831787},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33019590377807617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2169957458972931},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.11756649613380432},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.05670937895774841},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpads.2002.1183469","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2002.1183469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1589466281","https://openalex.org/W1977590451","https://openalex.org/W2026899276","https://openalex.org/W2057392949","https://openalex.org/W2060160256","https://openalex.org/W2092333800","https://openalex.org/W2154949349","https://openalex.org/W6635230930","https://openalex.org/W6665388660"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W2062808533","https://openalex.org/W1833217363","https://openalex.org/W1809394610","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2134658009","https://openalex.org/W2153689068","https://openalex.org/W2618418901","https://openalex.org/W2533764636"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,49],"fast":[4],"branch-and-bound":[5],"algorithm":[6,26],"for":[7,27,47],"solving":[8],"the":[9,20,29,37,42,45,53,64,67],"multiprocessor":[10],"scheduling":[11],"problem.":[12],"The":[13],"key":[14],"point":[15],"of":[16,22,55,66],"our":[17],"method":[18],"is":[19],"proposal":[21],"an":[23],"efficient":[24],"quadratic":[25],"calculating":[28,48],"Fernandez":[30],"and":[31,52],"Bussell's":[32],"(1973)":[33],"lower":[34,50],"bound.":[35],"In":[36],"following,":[38],"we":[39],"discuss":[40],"about":[41],"trade-off":[43],"between":[44],"cost":[46],"bound":[51],"size":[54],"pruned":[56],"subtrees.":[57],"Several":[58],"experiments":[59],"are":[60],"conducted":[61],"to":[62],"evaluate":[63],"goodness":[65],"proposed":[68],"method.":[69]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}