2 citations · 9 across the 18 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Approximate Total Weighted Completion Time with Convex Controllable Processing Times
Klaus Heeger, Danny Hermelin, Dvir Shabtay
We study the single-machine scheduling problem with controllable processing times to minimize the total weighted completion time, focusing on the setting where a job's processing t…
cs.DM2026
Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility
Robert Bredereck, Till Fluschnik, Klaus Heeger
We study the autarky problem: given an energy forecast, a battery, and a set of energy-consuming jobs with time windows, decide whether all jobs can be scheduled without requiring…