3 papers
cs.DS2026
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 jobs, where each job is characterized by a processing tim…
cs.DS2023
Simpler constant factor approximation algorithms for weighted flow time -- now for any -norm
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time…
cs.DS2022
A PTAS for Minimizing Weighted Flow Time on a Single Machine
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
An important objective in scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs where each job is characterized by a release time, a proce…