{"id":"https://openalex.org/W2007568515","doi":"https://doi.org/10.1145/1008731.1008732","title":"Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines","display_name":"Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2007568515","doi":"https://doi.org/10.1145/1008731.1008732","mag":"2007568515"},"language":"en","primary_location":{"id":"doi:10.1145/1008731.1008732","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1008731.1008732","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5039929633","display_name":"Luca Becchetti","orcid":"https://orcid.org/0000-0002-4941-0532"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Becchetti","raw_affiliation_strings":["University of Rome \"La Sapienza\", Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome \"La Sapienza\", Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Leonardi","raw_affiliation_strings":["University of Rome \"La Sapienza\", Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome \"La Sapienza\", Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":1.9733,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.88564688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"51","issue":"4","first_page":"517","last_page":"539"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.7400657534599304},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7167629599571228},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6582808494567871},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.528167188167572},{"id":"https://openalex.org/keywords/time-sharing","display_name":"Time-sharing","score":0.458647757768631},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4555046558380127},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.4292648732662201},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.41175219416618347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3982512652873993},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23111018538475037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22185787558555603},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14053356647491455}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7400657534599304},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7167629599571228},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6582808494567871},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.528167188167572},{"id":"https://openalex.org/C38725249","wikidata":"https://www.wikidata.org/wiki/Q913876","display_name":"Time-sharing","level":2,"score":0.458647757768631},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4555046558380127},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4292648732662201},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.41175219416618347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3982512652873993},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23111018538475037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22185787558555603},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14053356647491455},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1008731.1008732","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1008731.1008732","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.9594","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.9594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dis.uniroma1.it/~becchett/papers/jacm1.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/241441","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1008732","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"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":24,"referenced_works":["https://openalex.org/W276536446","https://openalex.org/W1511733714","https://openalex.org/W1847477019","https://openalex.org/W1901085887","https://openalex.org/W1916709771","https://openalex.org/W1958713532","https://openalex.org/W1984591711","https://openalex.org/W1987754328","https://openalex.org/W2037502715","https://openalex.org/W2041645394","https://openalex.org/W2042237882","https://openalex.org/W2042312329","https://openalex.org/W2047150311","https://openalex.org/W2051216594","https://openalex.org/W2056760235","https://openalex.org/W2071404693","https://openalex.org/W2117876074","https://openalex.org/W2133663637","https://openalex.org/W2164216960","https://openalex.org/W2912168264","https://openalex.org/W4302419487","https://openalex.org/W6640015234","https://openalex.org/W6684127376","https://openalex.org/W7001388669"],"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/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W4390751688"],"abstract_inverted_index":{"Scheduling":[0],"a":[1,13,22,88,141,178,194,223,236],"sequence":[2],"of":[3,12,40,48,91,111,114,171,180,187],"jobs":[4,58,172],"released":[5],"over":[6],"time":[7,11,29,47,55,160],"when":[8],"the":[9,38,41,44,49,53,60,69,78,92,112,124,157,162,169,207,217,232,241],"processing":[10],"job":[14],"is":[15,21,43,96,168],"only":[16],"known":[17],"at":[18],"its":[19],"completion":[20],"classical":[23],"problem":[24],"in":[25,28,59,104,121],"CPU":[26],"scheduling":[27,73],"sharing":[30],"operating":[31,71],"systems.":[32],"A":[33],"widely":[34],"used":[35],"measure":[36],"for":[37,98,140,183,192,244],"responsiveness":[39],"system":[42,61,72],"average":[45,54,158],"flow":[46,159],"jobs,":[50],"that":[51,87,117,173,216],"is,":[52],"spent":[56],"by":[57,136],"between":[62],"release":[63],"and":[64,68,100,138],"completion.The":[65],"Windows":[66],"NT":[67],"Unix":[70],"policies":[74],"are":[75,174],"based":[76],"on":[77,210,235],"Multilevel":[79,93,129],"Feedback":[80,94,130],"algorithm.":[81],"In":[82],"this":[83,245],"article,":[84],"we":[85],"prove":[86],"randomized":[89,128],"version":[90,179],"algorithm":[95,131,220],"competitive":[97,153,229],"single":[99,142,237],"parallel":[101,188,211],"machine":[102,143],"systems,":[103],"our":[105],"opinion":[106],"providing":[107],"one":[108],"theoretical":[109],"validation":[110],"goodness":[113],"an":[115,145],"idea":[116],"has":[118],"proven":[119],"effective":[120],"practice":[122],"along":[123],"last":[125],"two":[126],"decades.The":[127],"(RMLF)":[132],"was":[133],"first":[134,195],"proposed":[135],"Kalyanasundaram":[137],"Pruhs":[139],"achieving":[144],"O":[146,196,225],"(log":[147,197,226],"n":[148,151,167,198,200,227],"log":[149,150,199],")":[152,203,228],"ratio":[154,230],"to":[155],"minimize":[156],"against":[161,206,231],"on-line":[163],"adaptive":[164],"adversary,":[165],"where":[166],"number":[170,185],"released.":[175],"We":[176,190,213],"present":[177],"RMLF":[181,193,219],"working":[182],"any":[184],"m":[186,202],"machines.":[189,212],"show":[191,215],"/":[201],"competitiveness":[204],"result":[205],"oblivious":[208,233],"adversary":[209,234],"also":[214],"same":[218],"surprisingly":[221],"achieves":[222],"tight":[224],"machine,":[238],"therefore":[239],"matching":[240],"lower":[242],"bound":[243],"case.":[246]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}