The structure of assignment, precedence, and resource constraints in the ILP approach to the scheduling problem

Presents a general treatment of the combinatorial approach to the scheduling problem, enhancing previous formulations in the literature. The focus of this paper is a formal analysis of the integer linear programming (ILP) approach, which we use to evaluate the structure of our formulation. Polyhedral theory and duality theory are used to demonstrate that efficient solutions of the scheduling problem can be expected from a carefully formulated integer linear program. Furthermore, we use the theory of valid inequalities to tighten the constraints and make the formulation more efficient