{"id":"https://openalex.org/W4390694433","doi":"https://doi.org/10.1007/s10107-023-02045-0","title":"A competitive algorithm for throughput maximization on identical machines","display_name":"A competitive algorithm for throughput maximization on identical machines","publication_year":2024,"publication_date":"2024-01-10","ids":{"openalex":"https://openalex.org/W4390694433","doi":"https://doi.org/10.1007/s10107-023-02045-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-023-02045-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02045-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02045-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02045-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirk Pruhs","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clifford Stein","raw_affiliation_strings":["Industrial Engineering and Operations Research, Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090909905","display_name":"Rudy Zhou","orcid":"https://orcid.org/0000-0001-5037-4885"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rudy Zhou","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0001-5037-4885","affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044201440"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.3364,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53406749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"206","issue":"1-2","first_page":"497","last_page":"514"},"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.9987999796867371,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9807999730110168,"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/algorithm","display_name":"Algorithm","score":0.7067311406135559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638202428817749},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5593767762184143}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7067311406135559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638202428817749},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5593767762184143},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-023-02045-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02045-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02045-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10107-023-02045-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02045-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02045-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.46000000834465027,"display_name":"Decent work and economic growth"},{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G1288077169","display_name":null,"funder_award_id":"CMMI-1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2673416368","display_name":null,"funder_award_id":"CCF-1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3292004523","display_name":"SPX:  Collaborative Research:  Harnessing the Power of High-Bandwidth Memory via Provably Efficient Parallel Algorithms","funder_award_id":"1824303","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G338908218","display_name":"AF:Small: Algorithmic Management of Heterogeneous Resources","funder_award_id":"1907673","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4586274889","display_name":"Optimal Scheduling of Parallelizable Jobs in Cloud Computing Environments","funder_award_id":"1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4631877462","display_name":"SPX: Collaborative Research: Moving Towards Secure and Massive Parallel Computing","funder_award_id":"1822809","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5919211507","display_name":null,"funder_award_id":"CCF-2036077","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6054197994","display_name":null,"funder_award_id":"CCF-1714818","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6455149749","display_name":null,"funder_award_id":"CCF-1907673","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7145825387","display_name":"AF:Small:Beyond Worst Case Running time: Algorithms for Routing, Scheduling and Matching","funder_award_id":"1714818","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7361967927","display_name":"AITF: Applied Algorithmic Foundation for Scheduling Multiprogrammed Parallelizable Workloads","funder_award_id":"1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8411882594","display_name":null,"funder_award_id":"CCF-1845146","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G88388787","display_name":null,"funder_award_id":"CCF-1822809","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4390694433.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W204261080","https://openalex.org/W1972868674","https://openalex.org/W2007439549","https://openalex.org/W2025222277","https://openalex.org/W2044260124","https://openalex.org/W2080158054","https://openalex.org/W2773026493","https://openalex.org/W2902014351","https://openalex.org/W2964119755","https://openalex.org/W3023732341","https://openalex.org/W3163474831","https://openalex.org/W4285196344"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W1570112753","https://openalex.org/W601696587","https://openalex.org/W3088661666"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"the":[4,15],"basic":[5],"problem":[6],"of":[7,17,40],"scheduling":[8],"jobs":[9,18],"online":[10],"with":[11],"preemption":[12],"to":[13],"maximize":[14],"number":[16,39],"completed":[19],"by":[20],"their":[21],"deadline":[22],"on":[23],"m":[24],"identical":[25],"machines.":[26],"The":[27],"main":[28],"result":[29],"is":[30],"an":[31],"O":[32],"(1)":[33],"competitive":[34],"deterministic":[35],"algorithm":[36],"for":[37],"any":[38],"machines":[41],"$$m":[42],"&gt;1$$":[43],"<mml:math":[44],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[45],"<mml:mrow>":[46],"<mml:mi>m</mml:mi>":[47],"<mml:mo>&gt;</mml:mo>":[48],"<mml:mn>1</mml:mn>":[49],"</mml:mrow>":[50],"</mml:math>":[51],".":[52]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2025-10-10T00:00:00"}