31 search results - page 5 / 7 » Approximating Single Machine Scheduling with Scenarios |
IPCO
2007
13 years 8 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
DAM
2007
13 years 6 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...
IPCO
2004
13 years 8 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
ICALP
2003
Springer
14 years 3 days ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
SCHEDULING
2008
13 years 6 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...