19 search results - page 4 / 4 » The Constrained Minimum Weighted Sum of Job Completion Times... |
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
DAM
2007
13 years 4 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...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...