5 search results - page 1 / 1 » A Supermodular Relaxation for Scheduling with Release Dates |
IPCO
1996
13 years 5 months ago
1996
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 ...
JCO
1998
13 years 4 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
CP
2005
Springer
13 years 10 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
CONSTRAINTS
2006
13 years 4 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
SIAMDM
2002
13 years 4 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...