{"id":"https://openalex.org/W3216068169","doi":"https://doi.org/10.1145/3569582","title":"Online Throughput Maximization on Unrelated Machines: Commitment is No Burden","display_name":"Online Throughput Maximization on Unrelated Machines: Commitment is No Burden","publication_year":2022,"publication_date":"2022-12-14","ids":{"openalex":"https://openalex.org/W3216068169","doi":"https://doi.org/10.1145/3569582","mag":"3216068169"},"language":"en","primary_location":{"id":"doi:10.1145/3569582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569582","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1912.10769.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074436718","display_name":"Franziska Eberle","orcid":"https://orcid.org/0000-0001-8636-9711"},"institutions":[{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Franziska Eberle","raw_affiliation_strings":["Department of Mathematics, London School of Economics and Political Science, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-8636-9711","affiliations":[{"raw_affiliation_string":"Department of Mathematics, London School of Economics and Political Science, London, United Kingdom","institution_ids":["https://openalex.org/I909854389"]}]},{"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/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, University of Bremen, Bremen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3531-7644","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056422606","display_name":"Kevin Schewior","orcid":"https://orcid.org/0000-0003-2236-0210"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kevin Schewior","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2236-0210","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2273,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49671364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9943000078201294,"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/maximization","display_name":"Maximization","score":0.6060155630111694},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5629842877388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5388744473457336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28081339597702026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26278162002563477},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11485373973846436}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6060155630111694},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5629842877388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5388744473457336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28081339597702026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26278162002563477},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11485373973846436},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3569582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569582","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:oai:eprints.lse.ac.uk:123553","is_oa":false,"landing_page_url":"http://eprints.lse.ac.uk/123553/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:sdu.dk:publications/8ecb0542-873f-4dad-a1ee-98f3fe8ec1fb","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/8ecb0542-873f-4dad-a1ee-98f3fe8ec1fb","pdf_url":"https://arxiv.org/pdf/1912.10769.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eberle, F, Megow, N & Schewior, K 2023, 'Online throughput maximization on unrelated machines : Commitment is no burden', ACM Transactions on Algorithms, vol. 19, no. 1, 10, pp. 1-25. https://doi.org/10.1145/3569582","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:media.suub.uni-bremen.de:Publications/elib/8155","is_oa":true,"landing_page_url":"https://media.suub.uni-bremen.de/handle/elib/8155","pdf_url":"http://media.suub.uni-bremen.de/bitstreams/63b78b72-10d4-418b-b21a-30c757ce0adb/download","source":{"id":"https://openalex.org/S4306402486","display_name":"Media (https://www.suub.uni-bremen.de/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180437899","host_organization_name":"University of Bremen","host_organization_lineage":["https://openalex.org/I180437899"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel/Aufsatz"},{"id":"doi:10.26092/elib/3189","is_oa":true,"landing_page_url":"https://doi.org/10.26092/elib/3189","pdf_url":null,"source":{"id":"https://openalex.org/S7407052977","display_name":"Staats- und Universit\u00e4tsbibliothek Bremen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Other"}],"best_oa_location":{"id":"pmh:oai:sdu.dk:publications/8ecb0542-873f-4dad-a1ee-98f3fe8ec1fb","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/8ecb0542-873f-4dad-a1ee-98f3fe8ec1fb","pdf_url":"https://arxiv.org/pdf/1912.10769.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eberle, F, Megow, N & Schewior, K 2023, 'Online throughput maximization on unrelated machines : Commitment is no burden', ACM Transactions on Algorithms, vol. 19, no. 1, 10, pp. 1-25. https://doi.org/10.1145/3569582","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G6283469581","display_name":null,"funder_award_id":"ME 3825/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3216068169.pdf"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W197118576","https://openalex.org/W1561429731","https://openalex.org/W1565113225","https://openalex.org/W1568902948","https://openalex.org/W1879402272","https://openalex.org/W1941732106","https://openalex.org/W1972868674","https://openalex.org/W2007439549","https://openalex.org/W2022243760","https://openalex.org/W2025222277","https://openalex.org/W2025549137","https://openalex.org/W2040050870","https://openalex.org/W2044260124","https://openalex.org/W2069832779","https://openalex.org/W2074557115","https://openalex.org/W2078234942","https://openalex.org/W2080158054","https://openalex.org/W2081954069","https://openalex.org/W2087808272","https://openalex.org/W2092461546","https://openalex.org/W2099261768","https://openalex.org/W2140649695","https://openalex.org/W2145174892","https://openalex.org/W2155237069","https://openalex.org/W2165102171","https://openalex.org/W2473205901","https://openalex.org/W2534143023","https://openalex.org/W2617601670","https://openalex.org/W2793328768","https://openalex.org/W2808764965","https://openalex.org/W3023732341","https://openalex.org/W3041212826","https://openalex.org/W3089811425","https://openalex.org/W3105569215","https://openalex.org/W3163474831","https://openalex.org/W3212783160","https://openalex.org/W4244842914"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0,101,169],"consider":[1],"a":[2,28,33,60,82,137,143,189,209,219,225,232,255,294],"fundamental":[3],"online":[4,16,106,272],"scheduling":[5,81,205,284],"problem":[6],"in":[7,146,158,298],"which":[8,73,134],"jobs":[9,45,66],"with":[10],"processing":[11,90],"times":[12,88],"and":[13,114,162,257],"deadlines":[14],"arrive":[15],"over":[17],"time":[18,78,91,147],"at":[19,85,142],"their":[20,49],"release":[21],"dates.":[22],"The":[23],"task":[24],"is":[25,84,98,117,154,177,194,267],"to":[26,52,130,140,201],"determine":[27],"feasible":[29,77],"preemptive":[30],"schedule":[31],"on":[32,59,92,111,128,208,283],"single":[34,61,210],"or":[35],"multiple":[36],"possibly":[37],"unrelated":[38,112,174],"machines":[39,175],"that":[40,46,65,75,136,176,269],"maximizes":[41],"the":[42,76,103,118,126,148,183,195,262],"number":[43],"of":[44,121,150,166,227,235,300],"complete":[47],"before":[48,218],"deadline.":[50],"Due":[51],"strong":[53],"impossibility":[54],"results":[55,288],"for":[56,80,108,173,204,241],"competitive":[57,233,277],"analysis":[58],"machine,":[62],"we":[63,124,230,280],"require":[64],"contain":[67],"some":[68],"slack":[69,221],"\u025b":[70],">":[71],"0,":[72],"means":[74],"window":[79],"job":[83,256],"least":[86],"1+\u025b":[87],"its":[89,228],"each":[93],"eligible":[94],"machine.":[95,211],"Our":[96],"contribution":[97],"two-fold:":[99],"(i)":[100],"give":[102],"first":[104],"non-trivial":[105],"algorithms":[107],"throughput":[109],"maximization":[110],"machines,":[113],"(ii),":[115],"this":[116,193],"main":[119],"focus":[120,282],"our":[122,287],"paper,":[123],"answer":[125],"question":[127],"how":[129],"handle":[131],"commitment":[132,207,213,252,258,264],"requirements":[133],"enforce":[135],"scheduler":[138,184],"has":[139],"guarantee":[141],"certain":[144],"point":[145],"completion":[149],"admitted":[151],"jobs.":[152],"This":[153,247],"very":[155],"relevant,":[156],"e.g.,":[157],"providing":[159],"cloud-computing":[160],"services,":[161],"disallows":[163],"last-minute":[164],"rejections":[165],"critical":[167],"tasks.":[168],"present":[170],"an":[171],"algorithm":[172,273],"\\(\\Theta":[178],"(\\frac{1}{\\varepsilon":[179],"})\\)":[180,240],"-competitive":[181],"when":[182,291],"must":[185,215],"commit":[186],"upon":[187,253,259],"starting":[188,254],"job.":[190],"Somewhat":[191],"surprisingly,":[192],"same":[196],"optimal":[197,296],"performance":[198],"bound":[199],"(up":[200],"constants)":[202],"as":[203],"without":[206,285],"If":[212],"decisions":[214],"be":[216],"made":[217],"job\u2019s":[220],"becomes":[222],"less":[223],"than":[224],"\u03b4-fraction":[226],"size,":[229],"prove":[231],"ratio":[234],"\\(\\mathcal":[236],"{O}(\\frac{1}{\\varepsilon":[237],"-":[238],"\\delta":[239],"0":[242],"<":[243,245],"\u03b4":[244],"\u025b.":[246],"result":[248],"nicely":[249],"interpolates":[250],"between":[251],"arrival.":[260],"For":[261],"latter":[263],"model,":[265],"it":[266],"known":[268],"no":[270],"(randomized)":[271],"admits":[274],"any":[275],"bounded":[276],"ratio.":[278],"While":[279],"mainly":[281],"migration,":[286],"also":[289],"hold":[290],"comparing":[292],"against":[293],"migratory":[295],"solution":[297],"case":[299],"identical":[301],"machines.":[302]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}