6 search results - page 1 / 2 » A PTAS for Minimizing Weighted Completion Time on Uniformly ... |
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
MOR
2000
13 years 4 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...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
JCO
2007
13 years 5 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
DAM
2007
13 years 5 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...