139 search results - page 13 / 28 » Scheduling equal-length jobs on identical parallel machines |
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
RANDOM
1999
Springer
15 years 2 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
107
click to vote
LATIN
2010
Springer
14 years 12 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...