{"id":"https://openalex.org/W2012987319","doi":"https://doi.org/10.1137/060653445","title":"Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling","display_name":"Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2012987319","doi":"https://doi.org/10.1137/060653445","mag":"2012987319"},"language":"en","primary_location":{"id":"doi:10.1137/060653445","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060653445","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/A5109857068","display_name":"Ho-Leung Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Ho-Leung Chan","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077116003","display_name":"Tak\u2010Wah Lam","orcid":"https://orcid.org/0000-0003-4676-8587"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Tak-Wah Lam","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071535997","display_name":"Kin-Shing Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Kin-Shing Liu","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109857068"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09663206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"37","issue":"5","first_page":"1595","last_page":"1612"},"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.9976000189781189,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.992900013923645,"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.7813055515289307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6617380380630493},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6179542541503906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4671314060688019},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4352579414844513},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2645971179008484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2506150007247925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2431952953338623}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7813055515289307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6617380380630493},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6179542541503906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4671314060688019},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4352579414844513},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2645971179008484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2506150007247925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2431952953338623},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/060653445","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060653445","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"},{"id":"pmh:oai:hub.hku.hk:10722/88925","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/88925","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1492865622","https://openalex.org/W1565651529","https://openalex.org/W1584243868","https://openalex.org/W1747987134","https://openalex.org/W1972868674","https://openalex.org/W1984591711","https://openalex.org/W1987882231","https://openalex.org/W1994553105","https://openalex.org/W2009846993","https://openalex.org/W2012502482","https://openalex.org/W2042312329","https://openalex.org/W2045971730","https://openalex.org/W2047150311","https://openalex.org/W2051216594","https://openalex.org/W2058225986","https://openalex.org/W2071404693","https://openalex.org/W2074109829","https://openalex.org/W2081184049","https://openalex.org/W2086365412","https://openalex.org/W2117876074","https://openalex.org/W2133663637","https://openalex.org/W2144287101","https://openalex.org/W2170045213"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"We":[0,16],"study":[1],"online":[2],"scheduling":[3],"of":[4,31,76,93,117,129],"jobs":[5],"to":[6,26,132,176],"minimize":[7],"the":[8,29,56,160,184],"flow":[9,67,109,196,204],"time":[10,68,110,197],"and":[11,84,100,162,198,200],"stretch":[12,85,199],"on":[13],"parallel":[14],"machines.":[15],"consider":[17],"algorithms":[18,186],"that":[19,37,167],"are":[20,193],"given":[21],"extra":[22,125,149,180],"resources":[23],"so":[24],"as":[25,139],"compensate":[27],"for":[28,65,107,195,202],"lack":[30],"future":[32],"information.":[33],"Recent":[34],"results":[35,169,178],"show":[36],"a":[38,140,146,156],"modest":[39],"increase":[40],"in":[41,49,74,91,115],"machine":[42,142],"speed":[43,144],"can":[44,143,173],"provide":[45],"very":[46],"competitive":[47,134,168],"performance;":[48],"particular,":[50],"using":[51,188],"$O(1)$":[52,189],"times":[53,190],"faster":[54,130,141,171],"machines,":[55,181,192],"algorithm":[57],"SRPT":[58],"(shortest":[59],"remaining":[60],"processing":[61],"time)":[62],"is":[63,105,136],"1-competitive":[64,194],"both":[66],"[C.":[69],"A.":[70],"Phillips":[71],"et":[72,89,113],"al.,":[73,90,114],"Proceedings":[75,92,116],"STOC,":[77],"ACM,":[78],"New":[79],"York,":[80],"1997,":[81],"pp.":[82,98,122],"140\u2013149]":[83],"[W.":[86],"T.":[87],"Chan":[88],"MFCS,":[94],"Springer-Verlag,":[95,119],"Berlin,":[96,120],"2005,":[97],"236\u2013247]":[99],"HDF":[101],"(highest":[102],"density":[103],"first)":[104],"$O(1)$-competitive":[106,201],"weighted":[108,203],"[L.":[111],"Becchetti":[112],"RANDOM-APPROX,":[118],"2001,":[121],"36\u201347].":[123],"Using":[124],"unit-speed":[126,150,191],"machines":[127,131,151,172],"instead":[128],"achieve":[133],"performance":[135],"more":[137],"challenging,":[138],"up":[145],"job":[147],"but":[148],"cannot.":[152],"This":[153],"paper":[154],"gives":[155],"nontrivial":[157],"relationship":[158],"between":[159],"extra-speed":[161],"extra-machine":[163],"analyses.":[164],"It":[165],"shows":[166],"via":[170,179],"be":[174],"transformed":[175],"similar":[177],"hence":[182],"giving":[183],"first":[185],"that,":[187],"time.":[205]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}