{"id":"https://openalex.org/W2950803469","doi":"https://doi.org/10.1137/1.9781611973105.9","title":"A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio","display_name":"A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio","alternate_titles":[],"publication_year":2013,"publication_date":"2013-01-06","ids":{"openalex":"https://openalex.org/W2950803469","doi":"https://doi.org/10.1137/1.9781611973105.9","mag":"2950803469"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973105.9","doi":"https://doi.org/10.1137/1.9781611973105.9","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.9","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2950803469"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5077428374","display_name":"Elisabeth G\u00fcnther","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"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":["DE","IT"],"is_corresponding":false,"raw_author_name":"Elisabeth G\u00fcnther","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I4577782","https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025465452","display_name":"Olaf Maurer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"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":["DE","IT"],"is_corresponding":false,"raw_author_name":"Olaf Maurer","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I4577782","https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073490534","display_name":"Nicole Megow","orcid":"https://orcid.org/0000-0002-3531-7644","observed_orcids":["https://orcid.org/0000-0002-3531-7644"]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"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":["DE","IT"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I4577782","https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X","observed_orcids":["https://orcid.org/0000-0003-3705-016X","https://orcid.org/0000-0001-7814-8775"]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"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":["DE","IT"],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Mathematics, Technische Universit\u00e4t Berlin, GermanyDepartment of Computer and System Sciences, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I4577782","https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8297,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.90285714,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"128"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.95169997215271,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.95169997215271,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.03880000114440918,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/online-scheduling","display_name":"online scheduling","score":0.9729999899864197},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.9419999718666077},{"id":"https://openalex.org/keywords/total-weighted-completion-time","display_name":"total weighted completion time","score":0.9139999747276306},{"id":"https://openalex.org/keywords/parallel-machines","display_name":"parallel machines","score":0.7369999885559082},{"id":"https://openalex.org/keywords/related-machines","display_name":"related machines","score":0.9660000205039978},{"id":"https://openalex.org/keywords/unrelated-parallel-machines","display_name":"unrelated parallel machines","score":1.0},{"id":"https://openalex.org/keywords/randomized-online-algorithms","display_name":"randomized online algorithms","score":0.6949999928474426},{"id":"https://openalex.org/keywords/deterministic-online-algorithms","display_name":"deterministic online algorithms","score":0.9229999780654907},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9559999704360962}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9783574342727661},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8745051026344299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7053457498550415},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5980433225631714},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5671653747558594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5600179433822632},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5391604900360107},{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.48048344254493713},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.4180837869644165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3416254222393036},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2620348036289215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22338718175888062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1645902395248413},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09944546222686768},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/1.9781611973105.9","doi":"https://doi.org/10.1137/1.9781611973105.9","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.9","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:escidoc.org:escidoc:1922418","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0015-8890-0","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210088280","host_organization_name":"Max Planck Digital Library","host_organization_lineage":["https://openalex.org/I4210088280"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1922418","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0015-8890-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_2403693","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-002C-8E1A-F","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W36142361","https://openalex.org/W117086416","https://openalex.org/W1481967026","https://openalex.org/W1485083952","https://openalex.org/W1488422606","https://openalex.org/W1531908439","https://openalex.org/W1544352564","https://openalex.org/W1585522101","https://openalex.org/W1594394581","https://openalex.org/W1659780652","https://openalex.org/W1817173252","https://openalex.org/W1903284337","https://openalex.org/W1933011002","https://openalex.org/W1964085249","https://openalex.org/W1966527086","https://openalex.org/W1971354639","https://openalex.org/W1972459719","https://openalex.org/W1977040436","https://openalex.org/W1988328380","https://openalex.org/W2009134658","https://openalex.org/W2011039300","https://openalex.org/W2011670396","https://openalex.org/W2013170874","https://openalex.org/W2014071862","https://openalex.org/W2026040656","https://openalex.org/W2028301248","https://openalex.org/W2038303146","https://openalex.org/W2038661317","https://openalex.org/W2041645394","https://openalex.org/W2056094739","https://openalex.org/W2056273707","https://openalex.org/W2058876827","https://openalex.org/W2061672548","https://openalex.org/W2081798943","https://openalex.org/W2082859480","https://openalex.org/W2093979815","https://openalex.org/W2102201348","https://openalex.org/W2114146991","https://openalex.org/W2118097248","https://openalex.org/W2121129818","https://openalex.org/W2126520302","https://openalex.org/W2148204686","https://openalex.org/W2148301389","https://openalex.org/W2171261418","https://openalex.org/W2594258165","https://openalex.org/W2743045177","https://openalex.org/W3135987664"],"related_works":["https://openalex.org/W1623410360","https://openalex.org/W2793095688","https://openalex.org/W2003547835","https://openalex.org/W7135475063","https://openalex.org/W1930615501","https://openalex.org/W117086416","https://openalex.org/W1530414776","https://openalex.org/W2202920977","https://openalex.org/W2092227404","https://openalex.org/W1572887365"],"abstract_inverted_index":{"We":[0,44,87,120,171],"propose":[1],"a":[2,21,29,164,167,186],"new":[3,187],"approach":[4],"to":[5,34,52,92,100,125,137,163,180],"competitive":[6,30,38,134,161],"analysis":[7],"in":[8,192],"online":[9,26,42,51,81,112,190],"scheduling":[10,49],"by":[11],"introducing":[12],"the":[13,35,46,54,84,101,127,131,156,159],"novel":[14],"concept":[15,175],"of":[16,48,57,83,111,130],"competitive-ratio":[17],"approximation":[18],"schemes.":[19],"Such":[20],"scheme":[22],"algorithmically":[23],"constructs":[24],"an":[25,108,138],"algorithm":[27],"with":[28,115],"ratio":[31,39,135,162],"arbitrarily":[32],"close":[33],"best":[36,77,132],"possible":[37,78,133],"for":[40,158],"any":[41],"algorithm.":[43],"study":[45],"problem":[47],"jobs":[50],"minimize":[53],"weighted":[55],"sum":[56],"completion":[58],"times":[59],"on":[60,107,189],"parallel,":[61],"related,":[62],"and":[63,66,71,97,118,184],"unrelated":[64],"machines,":[65],"we":[67],"derive":[68],"both":[69],"deterministic":[70],"randomized":[72],"algorithms":[73,82,113,191],"which":[74],"are":[75],"almost":[76],"among":[79],"all":[80,145],"respective":[85],"settings.":[86],"also":[88,121,177],"generalize":[89],"our":[90,174],"techniques":[91],"arbitrary":[93,139],"monomial":[94],"cost":[95],"functions":[96],"apply":[98],"them":[99],"makespan":[102],"objective.":[103],"Our":[104],"method":[105],"relies":[106],"abstract":[109],"characterization":[110],"combined":[114],"various":[116],"simplifications":[117],"transformations.":[119],"contribute":[122],"algorithmic":[123],"means":[124],"compute":[126],"actual":[128],"value":[129],"up":[136],"accuracy.":[140],"This":[141],"strongly":[142],"contrasts":[143],"(nearly)":[144],"previous":[146],"manually":[147],"obtained":[148],"competitiveness":[149],"results":[150],"and,":[151],"most":[152],"importantly,":[153],"it":[154],"reduces":[155],"search":[157],"optimal":[160],"question":[165],"that":[166,173],"computer":[168],"can":[169,176],"answer.":[170],"believe":[172],"be":[178],"applied":[179],"many":[181],"other":[182],"problems":[183],"yields":[185],"perspective":[188],"general.":[193]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2950803469","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2019-06-27T00:00:00"}
