139 search results - page 11 / 28 » Scheduling equal-length jobs on identical parallel machines |
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
CCGRID
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on diff...
DAGSTUHL
2006
14 years 11 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...