{"id":"https://openalex.org/W2102252987","doi":"https://doi.org/10.1145/1536414.1536506","title":"A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation","display_name":"A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2102252987","doi":"https://doi.org/10.1145/1536414.1536506","mag":"2102252987"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5063065508","display_name":"Jivitej S. Chadha","orcid":null},"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":"Jivitej S. Chadha","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045952512","display_name":"Naveen Garg","orcid":"https://orcid.org/0000-0001-7923-4464"},"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":"Naveen Garg","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","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":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081959634","display_name":"V. N. Muralidhara","orcid":null},"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":"V. N. Muralidhara","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":4.6309,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.9502066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"679","last_page":"684"},"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.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.8681846261024475},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.8033686876296997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.675016462802887},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.579893946647644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5671323537826538},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5417370200157166},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5060335993766785},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43835970759391785},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4286934733390808},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41973716020584106},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.41493335366249084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25887545943260193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18556681275367737},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.10656028985977173},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.09102723002433777}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8681846261024475},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8033686876296997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.675016462802887},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.579893946647644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5671323537826538},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5417370200157166},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5060335993766785},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43835970759391785},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4286934733390808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41973716020584106},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.41493335366249084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25887545943260193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18556681275367737},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.10656028985977173},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.09102723002433777},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1536414.1536506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W230344389","https://openalex.org/W276536446","https://openalex.org/W1559482660","https://openalex.org/W1603330095","https://openalex.org/W1847477019","https://openalex.org/W2007568515","https://openalex.org/W2009844010","https://openalex.org/W2037502715","https://openalex.org/W2047150311","https://openalex.org/W2072626473","https://openalex.org/W2074109829","https://openalex.org/W2086365412","https://openalex.org/W2088810648","https://openalex.org/W2096825534","https://openalex.org/W2100283019","https://openalex.org/W2133663637","https://openalex.org/W2170045213","https://openalex.org/W2912168264","https://openalex.org/W3022037017","https://openalex.org/W6610148939"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W2012502482","https://openalex.org/W2777672110","https://openalex.org/W2086365412","https://openalex.org/W2949398645","https://openalex.org/W575343561","https://openalex.org/W2134553994","https://openalex.org/W2049971620"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,15,41,44,55,105],"online":[3,45],"problem":[4,21],"of":[5,43,54,104,110],"scheduling":[6],"jobs":[7,68],"on":[8,117],"unrelated":[9],"machines":[10,42],"so":[11],"as":[12],"to":[13,47,78,97],"minimize":[14],"total":[16],"weighted":[17],"flow":[18,115],"time.":[19],"This":[20],"has":[22],"an":[23,62,79],"unbounded":[24],"competitive":[25],"ratio":[26],"even":[27],"for":[28,112],"very":[29],"restricted":[30],"settings.":[31],"In":[32],"this":[33],"paper":[34],"we":[35,39,59,74],"show":[36],"that":[37],"if":[38],"allow":[40],"algorithm":[46,57,66,81,109],"have":[48],"e":[49],"more":[50],"speed":[51],"than":[52],"those":[53],"offline":[56,80],"then":[58],"can":[60,93],"get":[61],"O((1+e-1)2)-competitive":[63],"algorithm.":[64],"Our":[65,85],"schedules":[67],"preemptively":[69],"but":[70],"without":[71],"migration.":[72,84],"However,":[73],"compare":[75],"our":[76],"solution":[77],"which":[82,92],"allows":[83],"analysis":[86],"uses":[87],"a":[88,99],"potential":[89],"function":[90],"argument":[91],"also":[94],"be":[95],"extended":[96],"give":[98],"simpler":[100],"and":[101],"better":[102],"proof":[103],"randomized":[106],"immediate":[107],"dispatch":[108],"Chekuri-Goel-Khanna-Kumar":[111],"minimizing":[113],"average":[114],"time":[116],"parallel":[118],"machines.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}