We report new results for a time-indexed formulation of nonpreemptive single-machine scheduling problems. We give complete characterizations of all facet inducing inequalities with integral coefficients and right-hand side 1 or 2. Our results may lead to improved cutting plane algorithms for single-machine scheduling problems.
|Place of Publication
|Technische Universiteit Eindhoven
|Number of pages
|Published - 1993