Sciweavers

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

9

IPCO
1996

favoriteEmaildiscussreport

102views Optimization» more IPCO 1996»

A Supermodular Relaxation for Scheduling with Release Dates

13 years 5 months ago

A Supermodular Relaxation for Scheduling with Release Dates

Download math.mit.edu

We consider the schedulingproblem ofminimizinga weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this relaxation is precisely the projection of a time-indexed relaxation introduced by Dyer and Wolsey.

Michel X. Goemans

Real-time Traffic

Completion Times | IPCO 1996 | IPCO 2007 | Ofminimizinga Weighted Sum | Time-indexed Relaxation |

claim paper

Related Content

» Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

» Planning and Scheduling to Minimize Tardiness

» An Integrated Method for Planning and Scheduling to Minimize Tardiness

» Scheduling Unrelated Machines by Randomized Rounding

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	IPCO
Authors	Michel X. Goemans

Comments (0)