{"id":"https://openalex.org/W1623410360","doi":"https://doi.org/10.1145/2996800","title":"A New Approach to Online Scheduling","display_name":"A New Approach to Online Scheduling","publication_year":2016,"publication_date":"2016-12-21","ids":{"openalex":"https://openalex.org/W1623410360","doi":"https://doi.org/10.1145/2996800","mag":"1623410360"},"language":"en","primary_location":{"id":"doi:10.1145/2996800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2996800","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5057864029","display_name":"Elisabeth L\u00fcbbecke","orcid":"https://orcid.org/0000-0003-4544-445X"},"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"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Elisabeth L\u00fcbbecke","raw_affiliation_strings":["Technical University of Berlin","Technical University of Berlin,"],"affiliations":[{"raw_affiliation_string":"Technical University of Berlin","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technical University of Berlin,","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025465452","display_name":"Olaf Maurer","orcid":null},"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Olaf Maurer","raw_affiliation_strings":["Technical University of Berlin","Technical University of Berlin,"],"affiliations":[{"raw_affiliation_string":"Technical University of Berlin","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technical University of Berlin,","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073490534","display_name":"Nicole Megow","orcid":"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["Technical University of Berlin","Technical University of Berlin,"],"affiliations":[{"raw_affiliation_string":"Technical University of Berlin","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technical University of Berlin,","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Technical University of Berlin","Technical University of Berlin,"],"affiliations":[{"raw_affiliation_string":"Technical University of Berlin","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technical University of Berlin,","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057864029"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":2.3313,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88989488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"34"},"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.9968000054359436,"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.994700014591217,"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.9734812378883362},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.8840358853340149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6834658980369568},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6151785850524902},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5545804500579834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5070528984069824},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5020568370819092},{"id":"https://openalex.org/keywords/monomial","display_name":"Monomial","score":0.4773145616054535},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.45883291959762573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33414986729621887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2515866756439209},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.24385395646095276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11067456007003784}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9734812378883362},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8840358853340149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6834658980369568},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6151785850524902},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5545804500579834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5070528984069824},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5020568370819092},{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.4773145616054535},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.45883291959762573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33414986729621887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2515866756439209},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.24385395646095276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11067456007003784},{"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":2,"locations":[{"id":"doi:10.1145/2996800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2996800","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:vu:oai:research.vu.nl:publications/f9c95fed-3390-4706-8a4e-3cc828d4da64","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/f9c95fed-3390-4706-8a4e-3cc828d4da64","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Trans. Algorithms, 13(1), 15:1 - 15:34","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W36142361","https://openalex.org/W117086416","https://openalex.org/W1481967026","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/W1909205607","https://openalex.org/W1930615501","https://openalex.org/W1933011002","https://openalex.org/W1964085249","https://openalex.org/W1965437596","https://openalex.org/W1966527086","https://openalex.org/W1971354639","https://openalex.org/W1972459719","https://openalex.org/W1977040436","https://openalex.org/W1988328380","https://openalex.org/W2003547835","https://openalex.org/W2009134658","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/W2040475938","https://openalex.org/W2041645394","https://openalex.org/W2056094739","https://openalex.org/W2056273707","https://openalex.org/W2058817479","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/W2102588682","https://openalex.org/W2106121057","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/W2159036178","https://openalex.org/W2171261418","https://openalex.org/W2269281743","https://openalex.org/W2286838046","https://openalex.org/W2594258165","https://openalex.org/W2743045177","https://openalex.org/W3005451364","https://openalex.org/W3135987664","https://openalex.org/W4254031789","https://openalex.org/W4389615663","https://openalex.org/W6742705900"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2772037640","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":{"We":[0,44,87,120,172],"propose":[1],"a":[2,21,29,165,168,187],"new":[3,188],"approach":[4],"to":[5,34,52,92,100,125,137,164,181],"competitive":[6,30,38,134,162],"analysis":[7],"in":[8,193],"online":[9,26,42,51,81,112,191],"scheduling":[10,49],"by":[11],"introducing":[12],"the":[13,35,46,54,84,101,127,131,157,160],"novel":[14],"concept":[15,176],"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,144],"ratio":[31,39,135,163],"arbitrarily":[32],"close":[33],"best":[36,77,132],"possible":[37,78,133],"for":[40,159],"any":[41],"algorithm.":[43],"study":[45],"problem":[47],"jobs":[50],"minimize":[53],"weighted":[55],"sum":[56],"completion":[58],"times":[59],"on":[60,107,190],"parallel,":[61],"related,":[62],"and":[63,66,71,97,118,185],"unrelated":[64],"machines,":[65],"we":[67],"derive":[68],"both":[69],"deterministic":[70],"randomized":[72],"algorithms":[73,82,113,192],"that":[74,167,174],"are":[75],"almost":[76],"among":[79],"all":[80,146],"respective":[85],"settings.":[86],"also":[88,121,178],"generalize":[89],"our":[90,175],"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":[145],"previous":[147],"manually":[148],"obtained":[149],"competitiveness":[150],"results,":[151],"and,":[152],"most":[153],"importantly,":[154],"it":[155],"reduces":[156],"search":[158],"optimal":[161],"question":[166],"computer":[169],"can":[170,177],"answer.":[171],"believe":[173],"be":[179],"applied":[180],"many":[182],"other":[183],"problems":[184],"yields":[186],"perspective":[189],"general.":[194]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}