26 search results - page 2 / 6 » On unit task linear-nonlinear two-cluster scheduling problem |
AOR
2007
13 years 5 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
RTSS
2008
IEEE
13 years 11 months ago
2008
IEEE
The wide applications of cyber-physical systems (CPS) call for effective design strategies that optimize the performance of both computing units and physical plants. We study the ...
ECRTS
2005
IEEE
13 years 10 months ago
2005
IEEE
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
WADS
1997
Springer
13 years 9 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...