We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...