{"id":"https://openalex.org/W2069832779","doi":"https://doi.org/10.1137/s0097539799354138","title":"Approximating the Throughput of Multiple Machines in Real-Time Scheduling","display_name":"Approximating the Throughput of Multiple Machines in Real-Time Scheduling","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2069832779","doi":"https://doi.org/10.1137/s0097539799354138","mag":"2069832779"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799354138","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799354138","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5050059210","display_name":"Amotz Bar-Noy","orcid":"https://orcid.org/0009-0004-7021-9072"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amotz Bar-Noy","raw_affiliation_strings":["At&T#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"At&T#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["At&T#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"At&T#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":28.9288,"has_fulltext":false,"cited_by_count":184,"citation_normalized_percentile":{"value":0.9979895,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"31","issue":"2","first_page":"331","last_page":"352"},"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.9991999864578247,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962000250816345,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7352350950241089},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6356609463691711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5663373470306396},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5480648279190063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5463677644729614},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5298616290092468},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45444756746292114},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.40989258885383606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40924108028411865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3698512315750122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30574893951416016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2737065553665161},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06708618998527527}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7352350950241089},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6356609463691711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5663373470306396},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5480648279190063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5463677644729614},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5298616290092468},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45444756746292114},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.40989258885383606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40924108028411865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3698512315750122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30574893951416016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2737065553665161},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06708618998527527},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539799354138","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799354138","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.1456","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.1456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~sudipto/mypapers/throughput.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.4138","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eng.tau.ac.il/~amotz/WWW-PAPERS/scheduling.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.684.5793","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.684.5793","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/%7Esudipto/mypapers/throughput.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.4267","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.4267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/schedule.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1879402272","https://openalex.org/W1973315504","https://openalex.org/W1990180428","https://openalex.org/W1992649763","https://openalex.org/W1995953287","https://openalex.org/W2001364911","https://openalex.org/W2005186378","https://openalex.org/W2067297441","https://openalex.org/W2068428611","https://openalex.org/W2081414879","https://openalex.org/W2081954069","https://openalex.org/W2089078077","https://openalex.org/W2123862470","https://openalex.org/W3163474831","https://openalex.org/W4229642423"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W3204684126","https://openalex.org/W2963761620","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2045237525","https://openalex.org/W2019216770"],"abstract_inverted_index":{"We":[0,61],"consider":[1],"the":[2,10,21,40,52,71,75,78,84,87,101,137,175,190],"following":[3],"fundamental":[4],"scheduling":[5],"problem.":[6],"The":[7,42,111],"input":[8,165,204],"to":[9,45,97],"problem":[11],"consists":[12],"of":[13,20,39,54,70,77,86],"n":[14],"jobs":[15,22,55,88],"and":[16,33,83,100,122,133,151,166,179,186,205,217],"k":[17,134,187],"machines.":[18,41],"Each":[19],"is":[23,44],"associated":[24],"with":[25],"a":[26,29,31,34,47,125,142,152,159,167,196,206,220],"release":[27],"time,":[28],"deadline,":[30],"weight,":[32],"processing":[35],"time":[36],"on":[37,74],"each":[38],"goal":[43],"find":[46],"nonpreemptive":[48],"schedule":[49],"that":[50,56],"maximizes":[51],"weight":[53,85],"meet":[57],"their":[58],"respective":[59],"deadlines.":[60],"give":[62],"constant":[63],"factor":[64,199,209],"approximation":[65,145,198,208],"algorithms":[66],"for":[67,161,169,200,210],"four":[68],"variants":[69,94,103],"problem,":[72],"depending":[73],"type":[76],"machines":[79,106],"(identical":[80,89],"vs.":[81,90],"unrelated)":[82],"arbitrary).":[91],"All":[92],"these":[93],"are":[95,107,115,177],"known":[96],"be":[98],"NP-hard,":[99],"two":[102],"involving":[104],"unrelated":[105,123,173,218],"also":[108],"MAX-SNP":[109],"hard.":[110],"specific":[112],"results":[113],"obtained":[114],"as":[116],"follows:":[117],"For":[118,129,147,172,182,213],"identical":[119,130,135,188],"job":[120,131,149,184,215],"weights":[121,132,150,185,216],"machines:":[124,136,189,219],"greedy":[126,139],"2-approximation":[127,160],"algorithm.":[128,225],"same":[138],"algorithm":[140,192],"achieves":[141,158,195],"tight":[143],"$\\frac{(1+1/k)^k}{(1+1/k)^k-1}$":[144,197],"factor.":[146],"arbitrary":[148,170,183,211,214],"single":[153],"machine:":[154],"an":[155],"LP":[156],"formulation":[157],"polynomially":[162,201],"bounded":[163,202],"integral":[164,203],"3-approximation":[168],"input.":[171,212],"machines,":[174],"factors":[176],"3":[178],"4,":[180],"respectively.":[181],"LP-based":[191],"applied":[193],"repeatedly":[194],"$\\frac{(1+1/2k)^k}{(1+1/2k)^k-1}$":[207],"combinatorial":[221],"$(3+2\\sqrt{2}":[222],"\\approx":[223],"5.828)$-approximation":[224]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}