Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPCO
2004

favoriteEmaildiscussreport

142views Optimization» more IPCO 2004»

The Constrained Minimum Weighted Sum of Job Completion Times Problem

13 years 5 months ago

The Constrained Minimum Weighted Sum of Job Completion Times Problem

Download pluto.huji.ac.il

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

Real-time Traffic

IPCO 2004 | IPCO 2007 | Job Completion Times | Job Weights | Weighted Sum |

claim paper

Related Content

» An Approximation Algorithm for the Minimum Latency Set Cover Problem

» Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

» An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct ...

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Lower Bounds for Smiths Rule in Stochastic Machine Scheduling

» Preemptive Scheduling of EqualLength Jobs in Polynomial Time

» Approximating PrecedenceConstrained Single Machine Scheduling by Coloring

» On EnergyConstrained RealTime Scheduling

» Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Schedu...

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	IPCO
Authors	Asaf Levin, Gerhard J. Woeginger

Comments (0)