—Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are n...
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Scheduling term-end exams (TEE) at the United States Military Academy in West Point is unlike any other exam timetabling problem we know of. Exam timetabling normally produces a c...
Siqun Wang, Michael R. Bussieck, Monique Guignard,...
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...