{"id":"https://openalex.org/W2005075659","doi":"https://doi.org/10.1145/2651421","title":"Maximizing the Minimum Load for Random Processing Times","display_name":"Maximizing the Minimum Load for Random Processing Times","publication_year":2015,"publication_date":"2015-01-13","ids":{"openalex":"https://openalex.org/W2005075659","doi":"https://doi.org/10.1145/2651421","mag":"2005075659"},"language":"en","primary_location":{"id":"doi:10.1145/2651421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2651421","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/A5047303000","display_name":"Stefanie Gerke","orcid":"https://orcid.org/0000-0002-9426-1708"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Stefanie Gerke","raw_affiliation_strings":["Royal Holloway University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway University of London, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075970062","display_name":"\u039a\u03c9\u03bd\u03c3\u03c4\u03b1\u03bd\u03c4\u03af\u03bd\u03bf\u03c2 \u03a0\u03b1\u03bd\u03b1\u03b3\u03b9\u03ce\u03c4\u03bf\u03c5","orcid":"https://orcid.org/0000-0002-9258-6082"},"institutions":[{"id":"https://openalex.org/I4210127848","display_name":"Institut f\u00fcr Urheber- und Medienrecht","ror":"https://ror.org/035pp4s04","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210127848"]},{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Konstantinos Panagiotou","raw_affiliation_strings":["University of Munich, Germany","University of Munich , Germany"],"affiliations":[{"raw_affiliation_string":"University of Munich, Germany","institution_ids":["https://openalex.org/I4210127848","https://openalex.org/I8204097"]},{"raw_affiliation_string":"University of Munich , Germany","institution_ids":["https://openalex.org/I4210127848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013028051","display_name":"Justus Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Justus Schwartz","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062687538","display_name":"Angelika Steger","orcid":"https://orcid.org/0000-0002-3465-3996"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Angelika Steger","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047303000"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.07753881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.8214560747146606},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6855930685997009},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6419326066970825},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.5868750214576721},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5482578277587891},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5010700225830078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4739411175251007},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4585663080215454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4496139883995056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42986196279525757},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4210556447505951},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4210345149040222},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3854944109916687},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3748047947883606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33556750416755676},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22759020328521729},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1593080461025238}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.8214560747146606},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6855930685997009},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6419326066970825},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.5868750214576721},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5482578277587891},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5010700225830078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4739411175251007},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4585663080215454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4496139883995056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42986196279525757},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4210556447505951},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4210345149040222},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3854944109916687},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3748047947883606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33556750416755676},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22759020328521729},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1593080461025238},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2651421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2651421","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G1488695764","display_name":null,"funder_award_id":"200021-107880/1","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320309370","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W824171425","https://openalex.org/W1969869187","https://openalex.org/W1978593916","https://openalex.org/W1984792405","https://openalex.org/W1997761849","https://openalex.org/W2001927417","https://openalex.org/W2011039300","https://openalex.org/W2011643166","https://openalex.org/W2048624116","https://openalex.org/W2052294974","https://openalex.org/W2068859584","https://openalex.org/W2087547812","https://openalex.org/W2095585141","https://openalex.org/W2097612342","https://openalex.org/W2133097277"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W2051209951","https://openalex.org/W1493790977","https://openalex.org/W2358378335","https://openalex.org/W3135987664","https://openalex.org/W1881329561","https://openalex.org/W1977040436","https://openalex.org/W1996475154","https://openalex.org/W2087638517","https://openalex.org/W2953073202"],"abstract_inverted_index":{"In":[0],"this":[1,50],"article,":[2],"we":[3],"consider":[4,44],"a":[5,25,62,74,77,86,112,124,168],"stochastic":[6],"variant":[7],"of":[8,23,27,49,64,73,98,115,171],"the":[9,21,40,45,54,58,65,70,96,99,105,150,157,161,177],"so-called":[10],"Santa":[11,15],"Claus":[12,16],"problem.":[13],"The":[14],"problem":[17,22,52],"is":[18,76,85,101,180],"equivalent":[19],"to":[20,38,134],"scheduling":[24,51],"set":[26],"n":[28],"jobs":[29,100],"on":[30],"m":[31],"parallel":[32],"machines":[33],"without":[34],"preemption,":[35],"so":[36],"as":[37,143,145],"maximize":[39],"minimum":[41],"load.":[42],"We":[43,81],"identical":[46],"machine":[47],"version":[48],"with":[53],"additional":[55],"restriction":[56],"that":[57,68,83,94,136,148],"scheduler":[59],"has":[60,127],"only":[61],"guess":[63],"processing":[66,71],"times;":[67],"is,":[69,137],"time":[72],"job":[75],"random":[78],"variable":[79],".":[80,155],"show":[82],"there":[84],"critical":[87],"value":[88],"\u03c1":[89,116,172],"(":[90,117,173],"n,m":[91,118,174],")":[92,119],"such":[93],"if":[95,160],"duration":[97],"exponentially":[102],"distributed":[103],"and":[104],"expected":[106,129,162,178],"values":[107,152,163],"deviate":[108,164],"by":[109,165],"less":[110],"than":[111,167],"multiplicative":[113,169],"factor":[114,170],"from":[120],"each":[121],"other,":[122],"then":[123,176],"greedy":[125],"algorithm":[126,147],"an":[128,146],"competitive":[130],"ratio":[131],"arbitrarily":[132,181],"close":[133],"one;":[135],"it":[138],"performs":[139],"in":[140,153],"expectation":[141],"almost":[142],"good":[144],"knows":[149],"actual":[151],"advance":[154],"On":[156],"other":[158],"hand,":[159],"more":[166],"),":[175],"performance":[179],"bad":[182],"for":[183],"all":[184],"algorithms.":[185]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}