2 citations · 5 across the 18 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Approximation Algorithms for Fair Repetitive Scheduling
Danny Hermelin, Danny Segev, Dvir Shabtay
We consider a recently introduced fair repetitive scheduling problem involving a set of clients, each asking for their associated job to be daily scheduled on a single machine acro…
cs.DS2025
Faster Minimization of Total Weighted Completion Time on Parallel Machines
Danny Hermelin, Tomohiro Koana, Dvir Shabtay
We study the classical problem of minimizing the total weighted completion time on a fixed set of identical machines working in parallel, the problem in the s…