139 search results - page 8 / 28 » Scheduling equal-length jobs on identical parallel machines |
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors. Each job is owned by a selfish us...
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
103
click to vote
ESWA
2008
14 years 10 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
IPPS
2009
IEEE
15 years 4 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...
ESA
2009
Springer
15 years 2 months ago
2009
Springer
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...