1536 search results - page 56 / 308 » DPS - Dynamic Parallel Schedules |
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
102
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The performance of computer systems depends, among other things, on the workload. This motivates the use of real workloads (as recorded in activity logs) to drive simulations of n...
CLEIEJ
2004
14 years 11 months ago
2004
Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very diffic...
109
click to vote
COR
2007
14 years 11 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...