Integer and combinatorial optimization
Integer and combinatorial optimization
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
The Knowledge Engineering Review
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Hi-index | 0.01 |
We consider the problem of sequencing a set of jobs in a single machine to minimize the maximum of the total weighted completion time of the jobs over a number of scenarios, each corresponding to a set of job processing times. We give a large family of inequalities that are valid for the convex hull of the set of feasible schedules. We then present computational experience in which some of the inequalities are added to the original formulation. We demonstrate through the computational results that their addition to the formulation can substantially improve, among other things, the time required to solve difficult instances of the problem through branch-and-cut.