{"id":"https://openalex.org/W7147075144","doi":"https://doi.org/10.48550/arxiv.2603.29451","title":"Improved Approximation Algorithms for Non-Preemptive Throughput Maximization","display_name":"Improved Approximation Algorithms for Non-Preemptive Throughput Maximization","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147075144","doi":"https://doi.org/10.48550/arxiv.2603.29451"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.29451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29451","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.29451","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077840433","display_name":"Alexander Armbruster","orcid":"https://orcid.org/0009-0004-6826-398X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Armbruster, Alexander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grandoni, Fabrizio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075140072","display_name":"Antoine Tinguely","orcid":"https://orcid.org/0009-0000-7321-5457"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tinguely, Antoine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wiese, Andreas","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6114000082015991,"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.6114000082015991,"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.12710000574588776,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.12349999696016312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7825999855995178},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.659600019454956},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6273999810218811},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48240000009536743},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4733000099658966},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4366999864578247},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4011000096797943},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.3808000087738037}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7825999855995178},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.659600019454956},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6273999810218811},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6019999980926514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.597100019454956},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48240000009536743},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4733000099658966},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4366999864578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43540000915527344},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4011000096797943},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.3158999979496002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3147999942302704},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.30820000171661377},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.28450000286102295},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C127233936","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Entropy maximization","level":3,"score":0.2718000113964081},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.29451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29451","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.29451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.29451","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5195809602737427}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,78],"(Non-Preemptive)":[1],"Throughput":[2],"Maximization":[3],"problem":[4,71,121],"is":[5,21,44,72],"a":[6,24,28,33,55],"natural":[7],"and":[8,27],"fundamental":[9],"scheduling":[10],"problem.":[11],"We":[12],"are":[13,64,148],"given":[14,149],"$n$":[15],"jobs,":[16],"where":[17],"each":[18],"job":[19],"$j$":[20],"characterized":[22],"by":[23],"processing":[25],"time":[26,29,129],"window,":[30],"contained":[31],"in":[32,105,145],"global":[34],"interval":[35],"$[0,T)$,":[36],"during":[37],"which~$j$":[38],"can":[39],"be":[40,75],"scheduled.":[41],"Our":[42,139],"goal":[43],"to":[45,74,122,137,142],"schedule":[46],"the":[47,67,116,120,133,143],"maximum":[48],"possible":[49],"number":[50,152],"of":[51,88,153],"jobs":[52,63],"non-preemptively":[53],"on":[54,101],"single":[56],"machine,":[57],"so":[58],"that":[59],"no":[60],"two":[61],"scheduled":[62],"processed":[65],"at":[66],"same":[68],"time.":[69],"This":[70],"known":[73],"strongly":[76],"NP-hard.":[77],"best-known":[79],"approximation":[80,86,117],"algorithm":[81],"for":[82,119,124],"it":[83],"has":[84],"an":[85,102,150],"ratio":[87],"$1/0.6448":[89],"+":[90,94],"\\varepsilon":[91],"\\approx":[92],"1.551":[93],"\\varepsilon$":[95],"[Im,":[96],"Li,":[97],"Moseley":[98],"IPCO'17],":[99],"improving":[100],"earlier":[103],"result":[104],"[Chuzhoy,":[106],"Ostrovsky,":[107],"Rabani":[108],"FOCS'01].":[109],"In":[110],"this":[111],"paper":[112],"we":[113,131,147],"substantially":[114],"improve":[115,132],"factor":[118,134],"$4/3+\\varepsilon$":[123],"any":[125],"constant~$\\varepsilon>0$.":[126],"Using":[127],"pseudo-polynomial":[128],"$(nT)^{O(1)}$,":[130],"even":[135],"further":[136],"$5/4+\\varepsilon$.":[138],"results":[140],"extend":[141],"setting":[144],"which":[146],"arbitrary":[151],"(identical)":[154],"machines.":[155]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}