Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...