Live
Black Hat USAAI BusinessBlack Hat AsiaAI BusinessBuilding a RAG Pipeline From Scratch With LangChain + Pinecone + Claude: A Real ImplementationDEV CommunityWe Built an AI That Rewrites Its Own Brain. Here's What Happened.DEV CommunityCome ho costruito un generatore di testi AI moderno con React e VercelDEV CommunityHow CoinFello's MinChi Park Built the Trust Layer 500 Million Crypto Users Have Been Waiting ForHackernoon AII'm 18 and Built an Open-Source Camera That Cryptographically Proves Photos Are RealDEV CommunityMastering FastAPI: A Complete Learning RoadmapDEV CommunityI Built an AI Chatbot That Knows Everything About MeDEV CommunityEscaping API Quotas: How I Built a Local 14B Multi-Agent Squad for 16GB VRAM (Qwen3.5 & DeepSeek-R1)DEV CommunityI Built a FusionAuth SDK in Brainfuck and I'm Not Even a DeveloperDEV CommunityBattle Mage: We Built a Codebase Expert That Lives in SlackDEV CommunityBest Amazon Spring Sale deals under $25: Last chance to saveZDNet AIAnthropic's Claude Code leak reveals its "Kairos" updates, including letting Claude work in the background and using a "dream mode" to consolidate its memories (The Information)TechmemeBlack Hat USAAI BusinessBlack Hat AsiaAI BusinessBuilding a RAG Pipeline From Scratch With LangChain + Pinecone + Claude: A Real ImplementationDEV CommunityWe Built an AI That Rewrites Its Own Brain. Here's What Happened.DEV CommunityCome ho costruito un generatore di testi AI moderno con React e VercelDEV CommunityHow CoinFello's MinChi Park Built the Trust Layer 500 Million Crypto Users Have Been Waiting ForHackernoon AII'm 18 and Built an Open-Source Camera That Cryptographically Proves Photos Are RealDEV CommunityMastering FastAPI: A Complete Learning RoadmapDEV CommunityI Built an AI Chatbot That Knows Everything About MeDEV CommunityEscaping API Quotas: How I Built a Local 14B Multi-Agent Squad for 16GB VRAM (Qwen3.5 & DeepSeek-R1)DEV CommunityI Built a FusionAuth SDK in Brainfuck and I'm Not Even a DeveloperDEV CommunityBattle Mage: We Built a Codebase Expert That Lives in SlackDEV CommunityBest Amazon Spring Sale deals under $25: Last chance to saveZDNet AIAnthropic's Claude Code leak reveals its "Kairos" updates, including letting Claude work in the background and using a "dream mode" to consolidate its memories (The Information)Techmeme

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization

arXiv cs.DSby Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas WieseApril 1, 20261 min read0 views
Source Quiz

arXiv:2603.29451v1 Announce Type: new Abstract: The (Non-Preemptive) Throughput Maximization problem is a natural and fundamental scheduling problem. We are given $n$ jobs, where each job $j$ is characterized by a processing time and a time window, contained in a global interval $[0,T)$, during which~$j$ can be scheduled. Our goal is to schedule the maximum possible number of jobs non-preemptively on a single machine, so that no two scheduled jobs are processed at the same time. This problem is known to be strongly NP-hard. The best-known approximation algorithm for it has an approximation ratio of $1/0.6448 + \varepsilon \approx 1.551 + \varepsilon$ [Im, Li, Moseley IPCO'17], improving on an earlier result in [Chuzhoy, Ostrovsky, Rabani FOCS'01]. In this paper we substantially improve the

View PDF HTML (experimental)

Abstract:The (Non-Preemptive) Throughput Maximization problem is a natural and fundamental scheduling problem. We are given $n$ jobs, where each job $j$ is characterized by a processing time and a time window, contained in a global interval $[0,T)$, during which~$j$ can be scheduled. Our goal is to schedule the maximum possible number of jobs non-preemptively on a single machine, so that no two scheduled jobs are processed at the same time. This problem is known to be strongly NP-hard. The best-known approximation algorithm for it has an approximation ratio of $1/0.6448 + \varepsilon \approx 1.551 + \varepsilon$ [Im, Li, Moseley IPCO'17], improving on an earlier result in [Chuzhoy, Ostrovsky, Rabani FOCS'01]. In this paper we substantially improve the approximation factor for the problem to $4/3+\varepsilon$ for any constant~$\varepsilon>0$. Using pseudo-polynomial time $(nT)^{O(1)}$, we improve the factor even further to $5/4+\varepsilon$. Our results extend to the setting in which we are given an arbitrary number of (identical) machines.

Subjects:

Data Structures and Algorithms (cs.DS)

Cite as: arXiv:2603.29451 [cs.DS]

(or arXiv:2603.29451v1 [cs.DS] for this version)

https://doi.org/10.48550/arXiv.2603.29451

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Antoine Tinguely [view email] [v1] Tue, 31 Mar 2026 08:55:49 UTC (141 KB)

Was this article helpful?

Sign in to highlight and annotate this article

AI
Ask AI about this article
Powered by AI News Hub · full article context loaded
Ready

Conversation starters

Ask anything about this article…

Daily AI Digest

Get the top 5 AI stories delivered to your inbox every morning.

More about

announceglobalpaper

Knowledge Map

Knowledge Map
TopicsEntitiesSource
Improved Ap…announceglobalpaperarxivarXiv cs.DS

Connected Articles — Knowledge Graph

This article is connected to other articles through shared AI topics and tags.

Knowledge Graph100 articles · 232 connections
Scroll to zoom · drag to pan · click to open

Discussion

Sign in to join the discussion

No comments yet — be the first to share your thoughts!

More in Research Papers