173 search results - page 6 / 35 » Special Cases of Online Parallel Job Scheduling |
AOR
2006
13 years 8 months ago
2006
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
JSSPP
1995
Springer
13 years 11 months ago
1995
Springer
We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughpu...
IPCO
1998
13 years 9 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
ICALP
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
SIAMCOMP
2010
13 years 2 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...