200 search results - page 2 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
DFG
2009
Springer
13 years 11 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
ALGORITHMICA
2002
13 years 5 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
DISOPT
2008
13 years 5 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
ESA
2005
Springer
13 years 10 months ago
2005
Springer