Improved Approximation Algorithms for Non-Preemptive Throughput Maximization

Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely +1

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 tim…