{"id":"https://openalex.org/W2147705240","doi":"https://doi.org/10.1142/s0129054111008519","title":"WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION","display_name":"WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2147705240","doi":"https://doi.org/10.1142/s0129054111008519","mag":"2147705240"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054111008519","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008519","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5039604763","display_name":"Deshi Ye","orcid":"https://orcid.org/0000-0002-4764-1847"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"DESHI YE","raw_affiliation_strings":["College of Computer Science, Zhejiang University, Hangzhou 310027, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Zhejiang University, Hangzhou 310027, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101438463","display_name":"Qinming He","orcid":"https://orcid.org/0000-0001-5147-7253"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"QINMING HE","raw_affiliation_strings":["College of Computer Science, Zhejiang University, Hangzhou 310027, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Zhejiang University, Hangzhou 310027, China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23396722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"04","first_page":"971","last_page":"982"},"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/T12288","display_name":"Optimization and Search Problems","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/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/multiprocessing","display_name":"Multiprocessing","score":0.7222599983215332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7148087024688721},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6224983334541321},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6081255078315735},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5976904630661011},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5689378976821899},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5619882345199585},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5135674476623535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4641258716583252},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4498438835144043},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4227748215198517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33397144079208374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1980140209197998},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.13257047533988953}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7222599983215332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7148087024688721},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6224983334541321},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6081255078315735},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5976904630661011},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5689378976821899},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5619882345199585},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5135674476623535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4641258716583252},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4498438835144043},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4227748215198517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33397144079208374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1980140209197998},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.13257047533988953},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054111008519","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008519","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W204275623","https://openalex.org/W1501066815","https://openalex.org/W1523416710","https://openalex.org/W1552828154","https://openalex.org/W1584243868","https://openalex.org/W1685963381","https://openalex.org/W1972868674","https://openalex.org/W1972899329","https://openalex.org/W1995217454","https://openalex.org/W2001066639","https://openalex.org/W2015871191","https://openalex.org/W2040207325","https://openalex.org/W2045215405","https://openalex.org/W2054042656","https://openalex.org/W2063156615","https://openalex.org/W2081987145","https://openalex.org/W2089269509","https://openalex.org/W2115015692","https://openalex.org/W2119760147","https://openalex.org/W2131726714"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2970302286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,9,27,32,44,51,64,74,78,85],"worst-case":[3],"performance":[4],"of":[5,11],"approximation":[6,33],"algorithms":[7,34,56],"for":[8],"problem":[10],"multiprocessor":[12],"task":[13],"scheduling":[14],"on":[15],"m":[16,95],"identical":[17],"processors":[18,42],"with":[19],"resource":[20],"augmentation,":[21],"whose":[22],"objective":[23],"is":[24,81],"to":[25],"minimize":[26],"makespan.":[28],"In":[29],"this":[30],"case,":[31],"are":[35,57],"given":[36],"k":[37,93],"(k":[38],"\u2265":[39,94],"0)":[40],"extra":[41],"than":[43,84],"optimal":[45,86],"off-line":[46,60,87],"algorithm.":[47,69],"For":[48,59],"on-line":[49],"algorithms,":[50],"Greedy":[52],"algorithm":[53,80,88],"and":[54,90],"shelf":[55],"studied.":[58],"algorithm,":[61],"we":[62,71],"consider":[63],"LPT":[65,79],"(longest":[66],"processing":[67],"time)":[68],"Particularly,":[70],"prove":[72],"that":[73],"schedule":[75],"produced":[76],"by":[77],"no":[82],"longer":[83],"if":[89,92],"only":[91],"-":[96],"2.":[97]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}