We report new results for a time-indexed formulation of nonpreemptive single- machine scheduling problems. We give complete characterizations of all facet induc- ing inequalities with integral coecients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules,...