{"id":"https://openalex.org/W2170045213","doi":"https://doi.org/10.1145/1007352.1007411","title":"Multi-processor scheduling to minimize flow time with \u03b5 resource augmentation","display_name":"Multi-processor scheduling to minimize flow time with \u03b5 resource augmentation","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2170045213","doi":"https://doi.org/10.1145/1007352.1007411","mag":"2170045213"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent Bell Labs, Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101748190","display_name":"Ashish Goel","orcid":"https://orcid.org/0000-0003-0938-0401"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashish Goel","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Indian Inst. of Technology, New Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Inst. of Technology, New Delhi","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T11182","display_name":"Auction Theory and Applications","score":0.9753000140190125,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.694278359413147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6546328067779541},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6321402192115784},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5163604021072388},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5071630477905273},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4625629186630249},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4563189148902893},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4257148206233978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4224329888820648},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.4152040183544159},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23191341757774353},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1427622139453888}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.694278359413147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6546328067779541},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6321402192115784},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5163604021072388},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5071630477905273},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4625629186630249},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4563189148902893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4257148206233978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4224329888820648},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.4152040183544159},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23191341757774353},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1427622139453888},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1007352.1007411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.722","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~ashishg/papers/flowtime.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"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":28,"referenced_works":["https://openalex.org/W230344389","https://openalex.org/W1563703481","https://openalex.org/W1579946370","https://openalex.org/W1584243868","https://openalex.org/W1606894208","https://openalex.org/W1747987134","https://openalex.org/W1972868674","https://openalex.org/W1984034567","https://openalex.org/W1984591711","https://openalex.org/W1994553105","https://openalex.org/W2001016215","https://openalex.org/W2012502482","https://openalex.org/W2047150311","https://openalex.org/W2051216594","https://openalex.org/W2060640049","https://openalex.org/W2074109829","https://openalex.org/W2086365412","https://openalex.org/W2101204871","https://openalex.org/W2117876074","https://openalex.org/W2133663637","https://openalex.org/W2142258482","https://openalex.org/W2166867051","https://openalex.org/W2574678133","https://openalex.org/W2912168264","https://openalex.org/W3138991387","https://openalex.org/W6650619444","https://openalex.org/W6653530187","https://openalex.org/W6732183559"],"related_works":["https://openalex.org/W2058681277","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2090027528","https://openalex.org/W4241266436","https://openalex.org/W2208110155","https://openalex.org/W96431103","https://openalex.org/W2047204419","https://openalex.org/W2073006754","https://openalex.org/W2070734629"],"abstract_inverted_index":{"We":[0,19,43],"investigate":[1],"the":[2,21,24,82,102,105,143],"problem":[3],"of":[4,7,34,116],"online":[5],"scheduling":[6,58],"jobs":[8],"to":[9,125,168],"minimize":[10],"flow":[11,76,92,153,180],"time":[12,77,93,140,154,181],"and":[13,48,67,78,104,112,134,170,182,184],"stretch":[14,95],"on":[15],"m":[16,32],"identical":[17],"machines.":[18],"consider":[20],"case":[22],"where":[23],"algorithm":[25,119,131,146,162],"is":[26,132,148,166],"given":[27],"either":[28],"(1+\u03b5)m":[29],"machines":[30,33],"or":[31,94],"speed":[35],"(1+\u03b5),":[36],"for":[37,74,91,151,178,186,190],"arbitrarily":[38,97,156],"small":[39,98,157],"\u03b5":[40],">":[41],"0.":[42],"show":[44,176],"that":[45,163],"simple":[46,55],"randomized":[47,103,118],"deterministic":[49,106,161],"load":[50,107],"balancing":[51,108],"algorithms,":[52],"coupled":[53,135],"with":[54,96,136,155],"single":[56],"machine":[57],"strategies":[59],"such":[60],"as":[61],"SRPT":[62],"(shortest":[63,69,138],"remaining":[64],"processing":[65],"time)":[66],"SJF":[68],"job":[70,124],"first),":[71,141],"are":[72,81,110],"O(poly(1/\u03b5))-competitive":[73],"both":[75],"stretch.":[79],"These":[80],"first":[83,144],"results":[84],"which":[85,147],"prove":[86],"constant":[87,149],"factor":[88],"competitive":[89,150],"ratios":[90],"resource":[99,158],"augmentation.":[100,159],"Both":[101],"algorithms":[109],"non-migratory":[111],"do":[113],"immediate":[114],"dispatch":[115],"jobs.The":[117],"just":[120],"allocates":[121],"each":[122],"incoming":[123],"a":[126],"random":[127],"machine.":[128],"Hence":[129],"this":[130,173],"non-clairvoyant,":[133],"SETF":[137],"elapsed":[139],"yields":[142],"non-clairvoyant":[145],"minimizing":[152],"The":[160],"we":[164,175],"analyze":[165],"due":[167],"Avrahami":[169],"Azar.":[171],"For":[172],"algorithm,":[174],"O(1/\u03b5)-competitiveness":[177],"total":[179],"stretch,":[183],"also":[185],"their":[187],"Lp":[188],"norms,":[189],"any":[191],"fixed":[192],"p":[193],"\u2265":[194],"1.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}