{"id":"https://openalex.org/W2021697340","doi":"https://doi.org/10.1137/0221007","title":"Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling","display_name":"Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2021697340","doi":"https://doi.org/10.1137/0221007","mag":"2021697340"},"language":"en","primary_location":{"id":"doi:10.1137/0221007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221007","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5017670173","display_name":"Li-Hui Tsai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li-Hui Tsai","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017670173"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0192,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.77733107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"1","first_page":"59","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.837227463722229},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6506027579307556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5610912442207336},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5012459754943848},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4997231960296631},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4715839922428131},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46932289004325867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41980403661727905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36002638936042786},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3527553081512451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3494824469089508},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1143261194229126}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.837227463722229},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6506027579307556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5610912442207336},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5012459754943848},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4997231960296631},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4715839922428131},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46932289004325867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41980403661727905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36002638936042786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3527553081512451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3494824469089508},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1143261194229126},{"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0221007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221007","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1978788704","https://openalex.org/W1985246949","https://openalex.org/W1990990015","https://openalex.org/W2089099831","https://openalex.org/W2170926091","https://openalex.org/W2595897327","https://openalex.org/W4247899490"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3122821775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,10,14,25,54,58,90],"problem":[4],"of":[5,12,16,100],"assigning":[6,32],"n":[7],"tasks,":[8],"under":[9],"constraint":[11],"balancing":[13],"number":[15],"tasks":[17,38,91],"processed,":[18],"to":[19,23,39,48,63],"two":[20],"identical":[21],"processors":[22],"minimize":[24],"makespan.":[26],"The":[27,50],"authors":[28],"develop":[29],"an":[30],"algorithm":[31],"$\\lfloor":[33],"n/":[34,44],"2":[35,45],"\\rfloor":[36],"$":[37,47],"one":[40],"processor":[41,94],"and":[42,57,77],"$\\lceil":[43],"\\rceil":[46],"another.":[49],"absolute":[51],"difference":[52],"between":[53],"optimal":[55],"makespan":[56,60],"heuristic":[59],"is":[61,87],"proved":[62],"be":[64],"bounded":[65],"by":[66],"$O(\\log":[67],"n/n^2":[68],")$,":[69],"almost":[70],"surely,":[71],"when":[72],"task":[73],"durations":[74],"are":[75,95],"independently":[76],"uniformly":[78],"distributed":[79],"on":[80,92],"$[0,1]$.":[81],"In":[82],"addition,":[83],"total":[84],"flow":[85],"time":[86],"minimized":[88],"if":[89],"each":[93],"sequenced":[96],"in":[97],"nondecreasing":[98],"order":[99],"their":[101],"processing":[102],"times.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}