93 search results - page 2 / 19 » A Survey on Approximation Algorithms for Scheduling with Mac... |
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
INFORMS
2002
13 years 5 months ago
2002
MOR
2000
13 years 5 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
FSTTCS
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...