{"id":"https://openalex.org/W2160403707","doi":"https://doi.org/10.1137/s0895480101397761","title":"Optimal Online Algorithms for Minimax Resource Scheduling","display_name":"Optimal Online Algorithms for Minimax Resource Scheduling","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2160403707","doi":"https://doi.org/10.1137/s0895480101397761","mag":"2160403707"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480101397761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101397761","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5021428214","display_name":"Brady Hunsaker","orcid":"https://orcid.org/0009-0006-8156-217X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brady Hunsaker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027493354","display_name":"Anton J. Kleywegt","orcid":"https://orcid.org/0000-0002-1849-7276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anton J. Kleywegt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084185776","display_name":"Martin Savelsbergh","orcid":"https://orcid.org/0000-0001-7031-5516"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin W. P. Savelsbergh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079365209","display_name":"Craig A. Tovey","orcid":"https://orcid.org/0000-0002-1274-909X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Craig A. Tovey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.24531472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"16","issue":"4","first_page":"555","last_page":"590"},"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9955000281333923,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.5845102071762085},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5688754916191101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564805805683136},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5399316549301147},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4816545248031616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4668370485305786},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4539882242679596},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4284234941005707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3523310422897339}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5845102071762085},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5688754916191101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564805805683136},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5399316549301147},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4816545248031616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4668370485305786},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4539882242679596},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4284234941005707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3523310422897339}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0895480101397761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101397761","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.2251","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.2251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isye.gatech.edu/faculty/Anton_Kleywegt/dmmp2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.1646","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.1646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.isye.gatech.edu/~ctovey/publications/papers/ommp-rev.pdf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4099999964237213,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1481967026","https://openalex.org/W1538183795","https://openalex.org/W1840965997","https://openalex.org/W1963663039","https://openalex.org/W1972257233","https://openalex.org/W2012228660","https://openalex.org/W2027131870","https://openalex.org/W2027920448","https://openalex.org/W2038990377","https://openalex.org/W2050345497","https://openalex.org/W2064467943","https://openalex.org/W2084150917","https://openalex.org/W2089269509","https://openalex.org/W2156867662","https://openalex.org/W2295428206","https://openalex.org/W2911330481","https://openalex.org/W4231916799"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455","https://openalex.org/W2350876336","https://openalex.org/W1970915793"],"abstract_inverted_index":{"We":[0,19,30,48,66],"consider":[1],"a":[2,21,84],"very":[3],"general":[4],"online":[5,28,54],"scheduling":[6,43],"problem":[7],"with":[8],"an":[9,25],"objective":[10],"to":[11,51],"minimize":[12],"the":[13,35,78],"maximum":[14],"level":[15],"of":[16,24,40,80,87],"resource":[17,42,88],"allocated.":[18],"find":[20],"simple":[22],"characterization":[23],"optimal":[26,53],"deterministic":[27,73],"algorithm.":[29],"develop":[31],"further":[32],"results":[33],"for":[34,56],"two,":[36],"more":[37],"specific":[38],"problems":[39,58],"single":[41],"and":[44,62],"hierarchical":[45],"line":[46],"balancing.":[47],"determine":[49],"how":[50],"compute":[52],"algorithms":[55,70],"both":[57],"using":[59],"linear":[60],"programming":[61],"integer":[63],"programming,":[64],"respectively.":[65],"show":[67],"that":[68],"randomized":[69],"can":[71],"outperform":[72],"algorithms,":[74],"but":[75],"only":[76],"if":[77],"amount":[79],"work":[81],"done":[82],"is":[83],"nonconcave":[85],"function":[86],"allocation.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}