{"id":"https://openalex.org/W2295822836","doi":"https://doi.org/10.4086/toc.2012.v008a007","title":"","display_name":"","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2295822836","doi":"https://doi.org/10.4086/toc.2012.v008a007","mag":"2295822836"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2012.v008a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a007","pdf_url":"http://www.theoryofcomputing.org/articles/v008a007/v008a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v008a007/v008a007.pdf","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":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1179,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8145098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"8","issue":"1","first_page":"165","last_page":"195"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9900000095367432,"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.9884999990463257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6941626071929932},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6732126474380493},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6555625796318054},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5221427083015442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43840572237968445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28650543093681335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27675026655197144}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6941626071929932},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6732126474380493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6555625796318054},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5221427083015442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43840572237968445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28650543093681335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27675026655197144},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2012.v008a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a007","pdf_url":"http://www.theoryofcomputing.org/articles/v008a007/v008a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2012.v008a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a007","pdf_url":"http://www.theoryofcomputing.org/articles/v008a007/v008a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G2538000623","display_name":"Approximation Algorithms for Routing and Network Design","funder_award_id":"0728782","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2295822836.pdf","grobid_xml":"https://content.openalex.org/works/W2295822836.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W81848849","https://openalex.org/W98190632","https://openalex.org/W1498726528","https://openalex.org/W1506292197","https://openalex.org/W1528341984","https://openalex.org/W1571155498","https://openalex.org/W1618165415","https://openalex.org/W1868304495","https://openalex.org/W1911636809","https://openalex.org/W1923579438","https://openalex.org/W1966544820","https://openalex.org/W1970286891","https://openalex.org/W1972868674","https://openalex.org/W1981710280","https://openalex.org/W1986250791","https://openalex.org/W1996696855","https://openalex.org/W2007479771","https://openalex.org/W2007604989","https://openalex.org/W2019306084","https://openalex.org/W2020636116","https://openalex.org/W2024161125","https://openalex.org/W2047066090","https://openalex.org/W2051216594","https://openalex.org/W2054322995","https://openalex.org/W2067103503","https://openalex.org/W2086754585","https://openalex.org/W2088810648","https://openalex.org/W2092068825","https://openalex.org/W2096318933","https://openalex.org/W2105862720","https://openalex.org/W2106728658","https://openalex.org/W2107494406","https://openalex.org/W2109827459","https://openalex.org/W2120603663","https://openalex.org/W2127274846","https://openalex.org/W2133663637","https://openalex.org/W2151527192","https://openalex.org/W2155167089","https://openalex.org/W2168902131","https://openalex.org/W2170045213","https://openalex.org/W2179639784","https://openalex.org/W2322096602","https://openalex.org/W2619929065","https://openalex.org/W2914802492","https://openalex.org/W2950870724","https://openalex.org/W3138033350","https://openalex.org/W4206828242","https://openalex.org/W4235615915","https://openalex.org/W4252287629","https://openalex.org/W4255593251","https://openalex.org/W4391285994"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1488585910","https://openalex.org/W2563401265","https://openalex.org/W2012502482","https://openalex.org/W1969305723","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"several":[3],"online":[4],"scheduling":[5,53,68],"algorithms":[6],"for":[7],"two":[8],"related":[9],"performance":[10],"metrics,":[11],"namely":[12],"maximum":[13,17,40],"response":[14,42],"time":[15,43],"and":[16,19],"delay-factor,":[18],"also":[20],"their":[21],"weighted":[22,41],"versions.":[23],"The":[24],"delay":[25],"factor":[26],"metric":[27],"is":[28],"new":[29],"(introduced":[30],"in":[31],"Chang":[32],"et":[33],"al.":[34],"(SODA'08)),":[35],"while":[36],"special":[37],"cases":[38],"of":[39],"have":[44],"been":[45],"considered":[46],"before.":[47],"We":[48],"study":[49],"both":[50],"the":[51,66],"standard":[52],"model":[54,69],"where":[55,70],"each":[56],"arriving":[57],"job":[58],"requires":[59],"its":[60],"own":[61],"processing,":[62],"as":[63,65],"well":[64],"broadcast":[67],"multiple":[71],"requests/jobs":[72],"can":[73],"be":[74],"simultaneously":[75],"satisfied.":[76]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}