{"id":"https://openalex.org/W4412482057","doi":"https://doi.org/10.1145/3694906.3743340","title":"Approximation Hardness of Resource Scheduling","display_name":"Approximation Hardness of Resource Scheduling","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412482057","doi":"https://doi.org/10.1145/3694906.3743340"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743340","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743340","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020629410","display_name":"Rathish Das","orcid":"https://orcid.org/0000-0002-2416-6422"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rathish Das","raw_affiliation_strings":["University of Houston, Houston, Texas, United States"],"raw_orcid":"https://orcid.org/0000-0002-2416-6422","affiliations":[{"raw_affiliation_string":"University of Houston, Houston, Texas, United States","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041541812","display_name":"Hao Sun","orcid":"https://orcid.org/0000-0002-2000-8080"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hao Sun","raw_affiliation_strings":["University of Houston, Houston, Texas, United States"],"raw_orcid":"https://orcid.org/0000-0002-2000-8080","affiliations":[{"raw_affiliation_string":"University of Houston, Houston, Texas, United States","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020629410"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23620209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.9954000115394592,"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.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.5921775102615356},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4719744622707367},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46275708079338074},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43163448572158813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3947839140892029},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.31130337715148926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2652982473373413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18364012241363525},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.099368155002594}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5921775102615356},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4719744622707367},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46275708079338074},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43163448572158813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3947839140892029},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.31130337715148926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2652982473373413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18364012241363525},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.099368155002594}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743340","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743340","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412482057.pdf","grobid_xml":"https://content.openalex.org/works/W4412482057.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W175711003","https://openalex.org/W1540493477","https://openalex.org/W1555279366","https://openalex.org/W1633067272","https://openalex.org/W1841032795","https://openalex.org/W1967030015","https://openalex.org/W1973129504","https://openalex.org/W1978018278","https://openalex.org/W1985211757","https://openalex.org/W1992810489","https://openalex.org/W1993720874","https://openalex.org/W1999314592","https://openalex.org/W2001066639","https://openalex.org/W2010260400","https://openalex.org/W2016559894","https://openalex.org/W2038345112","https://openalex.org/W2042017208","https://openalex.org/W2046471719","https://openalex.org/W2053393747","https://openalex.org/W2054042656","https://openalex.org/W2055717964","https://openalex.org/W2057913648","https://openalex.org/W2067522613","https://openalex.org/W2067801697","https://openalex.org/W2072725684","https://openalex.org/W2075200534","https://openalex.org/W2076672803","https://openalex.org/W2081785581","https://openalex.org/W2081987145","https://openalex.org/W2082864830","https://openalex.org/W2090166506","https://openalex.org/W2105754437","https://openalex.org/W2110856814","https://openalex.org/W2115015692","https://openalex.org/W2116636977","https://openalex.org/W2128274900","https://openalex.org/W2146181091","https://openalex.org/W2148204686","https://openalex.org/W2150446509","https://openalex.org/W2154305205","https://openalex.org/W2272917567","https://openalex.org/W2562755098","https://openalex.org/W2577702044","https://openalex.org/W2736011387","https://openalex.org/W2893020490","https://openalex.org/W2912720049","https://openalex.org/W2935959957","https://openalex.org/W3041837310","https://openalex.org/W3041850557","https://openalex.org/W3099569436","https://openalex.org/W3116040173","https://openalex.org/W3138484722","https://openalex.org/W3202711568","https://openalex.org/W4205190765","https://openalex.org/W4210896998","https://openalex.org/W4231916799","https://openalex.org/W4285013708","https://openalex.org/W4318719213","https://openalex.org/W4372046852","https://openalex.org/W6633077795","https://openalex.org/W6661349555","https://openalex.org/W6748656999","https://openalex.org/W6839384569"],"related_works":["https://openalex.org/W2128410848","https://openalex.org/W2118368532","https://openalex.org/W2102390841","https://openalex.org/W3047653192","https://openalex.org/W2096289371","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2946406471","https://openalex.org/W2130555437"],"abstract_inverted_index":{"We":[0,101],"study":[1],"the":[2,27,34,45,48,67,74,79,84,135,139],"precedence-constrained":[3],"resource":[4,24,42,69,81],"scheduling":[5],"problem":[6,37,140],"[SICOMP'75].":[7],"There":[8,30],"are":[9,31],"n":[10],"jobs":[11,46,75],"where":[12],"each":[13],"job":[14,143],"takes":[15],"a":[16,23,41,58,93,115],"certain":[17],"time":[18,56],"to":[19,51],"finish":[20],"and":[21],"has":[22],"requirement":[25],"throughout":[26],"execution":[28],"time.":[29],"precedence":[32,49],"among":[33],"jobs.":[35],"The":[36],"asks":[38],"that":[39,61,103,119],"given":[40,80],"budget,":[43],"schedule":[44],"obeying":[47],"constraints":[50],"minimize":[52],"makespan":[53],"(maximum":[54],"completion":[55],"of":[57,105,138,153],"job)":[59],"such":[60],"at":[62,77],"any":[63],"point":[64],"in":[65],"time,":[66],"total":[68],"being":[70],"used":[71],"by":[72],"all":[73],"is":[76,91,127,149],"most":[78],"budget.":[82],"In":[83,111],"offline":[85,136],"setting,":[86],"an":[87],"important":[88],"open":[89],"question":[90],"whether":[92],"polynomial-time":[94],"O(1)-factor":[95],"approximation":[96,108,132],"algorithm":[97,133],"can":[98],"be":[99],"found.":[100],"prove":[102,114],"hardness":[104],"constant":[106,122],"factor":[107],"unless":[109,155],"P=NP.":[110],"fact,":[112],"we":[113],"stronger":[116],"lower":[117],"bound":[118],"for":[120,134],"some":[121],"\u03b1":[123],">":[124],"0,":[125],"there":[126,148],"no":[128],"o":[129],"((log":[130],"tmax)\u03b1)-factor":[131],"version":[137],"with":[141],"maximum":[142],"length":[144],"tmax,":[145],"even":[146],"if":[147],"only":[150],"one":[151],"type":[152],"resource,":[154],"P":[156],"=":[157],"NP.":[158]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}