{"id":"https://openalex.org/W1977590451","doi":"https://doi.org/10.1109/tc.1984.1676376","title":"Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing","display_name":"Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing","publication_year":1984,"publication_date":"1984-11-01","ids":{"openalex":"https://openalex.org/W1977590451","doi":"https://doi.org/10.1109/tc.1984.1676376","mag":"1977590451"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1984.1676376","doi":"https://doi.org/10.1109/tc.1984.1676376","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676376","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5072859004","display_name":"Hironori Kasahara","orcid":"https://orcid.org/0000-0001-7984-756X","observed_orcids":["https://orcid.org/0000-0001-7984-756X"]},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kasahara","raw_affiliation_strings":["Department of Electrical Engineering, Waseda University","Department of Electrical Engineering, Waseda University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Waseda University","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"Department of Electrical Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053890425","display_name":"Narita","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Narita","raw_affiliation_strings":["Department of Electrical Engineering, Waseda University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I150744194"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":23.3102,"has_fulltext":false,"cited_by_count":453,"citation_normalized_percentile":{"value":0.99145803,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"C-33","issue":"11","first_page":"1023","last_page":"1029"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8378999829292297,"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.8378999829292297,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.04259999841451645,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.0333000011742115,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"multiprocessor scheduling","score":0.9610000252723694},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8479999899864197},{"id":"https://openalex.org/keywords/np-hard-scheduling-problems","display_name":"NP-hard scheduling","score":0.5740000009536743},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7160000205039978},{"id":"https://openalex.org/keywords/scheduling-heuristics","display_name":"heuristic scheduling","score":0.6349999904632568},{"id":"https://openalex.org/keywords/critical-path","display_name":"critical path","score":0.7070000171661377},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7889999747276306},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.6100000143051147},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.4099999964237213}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7527683973312378},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6651869416236877},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5938947200775146},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5859623551368713},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5331968665122986},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5025336742401123},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48831698298454285},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.47779425978660583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4666438400745392},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44850507378578186},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.44754257798194885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4420970678329468},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44135743379592896},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42323267459869385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41072607040405273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17830121517181396},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.1431483030319214},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1984.1676376","doi":"https://doi.org/10.1109/tc.1984.1676376","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676376","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1655990431","https://openalex.org/W2009990213","https://openalex.org/W2011039300","https://openalex.org/W2026899276","https://openalex.org/W2027077493","https://openalex.org/W2040877664","https://openalex.org/W2057108708","https://openalex.org/W2060160918","https://openalex.org/W2062366221","https://openalex.org/W2078162318","https://openalex.org/W2092333800","https://openalex.org/W2104680817","https://openalex.org/W2109155166","https://openalex.org/W2125690626","https://openalex.org/W2144931885","https://openalex.org/W2150446509","https://openalex.org/W2167384564","https://openalex.org/W2599581701","https://openalex.org/W2733502041","https://openalex.org/W4300129394"],"related_works":["https://openalex.org/W1981087563","https://openalex.org/W2132127630","https://openalex.org/W7001207536","https://openalex.org/W55610023","https://openalex.org/W2164422072","https://openalex.org/W1993683891","https://openalex.org/W2364223843","https://openalex.org/W2133476995","https://openalex.org/W2468395309","https://openalex.org/W2157254931"],"abstract_inverted_index":{"This":[0,63],"paper":[1,64],"describes":[2],"practical":[3],"optimization/":[4],"approximation":[5,57],"algorithms":[6,51],"for":[7],"scheduling":[8,90],"a":[9,17,66,119],"set":[10],"of":[11,35,44,131],"partially":[12],"ordered":[13],"computational":[14],"tasks":[15],"onto":[16],"multiprocessor":[18],"system":[19],"so":[20],"that":[21],"the":[22,33,42,104,129,132],"schedule":[23],"length":[24],"will":[25],"be":[26],"minimized.":[27],"Since":[28],"this":[29],"problem":[30],"belongs":[31],"to":[32,112,127],"class":[34],"''strong''":[36],"NP-hard":[37],"problems,":[38],"we":[39],"must":[40],"foreclose":[41],"possibility":[43],"constructing":[45],"not":[46],"only":[47],"pseudopolynomial":[48],"time":[49,56,101],"optimization":[50],"but":[52],"also":[53],"fully":[54],"polynomial":[55],"schemes":[58],"unless":[59],"P":[60],"=":[61],"NP.":[62],"proposes":[65],"heuristic":[67,84],"algorithm":[68,79],"named":[69,80],"CP/MISF":[70],"(critical":[71],"path/most":[72],"immediate":[73],"successors":[74],"first)":[75],"and":[76,98],"an":[77,88],"optimization/approximation":[78],"DF/IHS":[81,86],"(d":[82],"thfirst/implicit":[83],"search).":[85],"is":[87],"excellent":[89],"method":[91,106],"which":[92],"can":[93],"reduce":[94],"markedly":[95],"space":[96],"complexity":[97],"average":[99],"computation":[100],"by":[102],"combining":[103],"branch-and-bound":[105],"with":[107,118],"CP/MISF;":[108],"it":[109],"allows":[110],"us":[111],"solve":[113],"very":[114],"large":[115],"scale":[116],"problems":[117],"few":[120],"hundred":[121],"tasks.":[122],"Numerical":[123],"examples":[124],"are":[125],"included":[126],"demonstrate":[128],"effectiveness":[130],"proposed":[133],"algorithms.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}