93 search results - page 2 / 19 » A Survey on Approximation Algorithms for Scheduling with Mac... |
91
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
88
Voted
INFORMS
2002
15 years 3 months ago
2002
136
Voted
MOR
2000
15 years 3 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...
149
Voted
FSTTCS
1999
Springer
15 years 7 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...