Sciweavers

Share
IPCO
2004

The Constrained Minimum Weighted Sum of Job Completion Times Problem

8 years 11 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
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 weighted sum of job completion times (with respect to different job weights). This problem is NP-hard, and we provide a polynomial time approximation scheme for this problem. Our method is based on Lagrangian relaxation mixed with carefully guessing the positions of certain jobs in the schedule.
Asaf Levin, Gerhard J. Woeginger
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where IPCO
Authors Asaf Levin, Gerhard J. Woeginger
Comments (0)
books