13 citations · 36 across the 9 of their papers we have counts for
3 papers · 1 filter
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
Sven Jäger, Alexander Lindermayr, Nicole Megow
The Polytope Scheduling Problem (PSP) was introduced by Im, Kulkarni, and Munagala (JACM 2018) as a very general abstraction of resource allocation over time and captures many well…
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs
Sven Jäger, Philipp Warode
We consider the precedence-constrained scheduling problem to minimize the total weighted completion time. For a single machine several -approximation algorithms are known, which…
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt +1
We study kill-and-restart and preemptive strategies for the fundamental scheduling problem of minimizing the sum of weighted completion times on a single machine in the non-clairvo…