ILP-based scheduling with time and resource constraints in high level synthesis

Presents a formal analysis of the constraints of the scheduling problem, and evaluates the structure of the scheduling polytope described by those constraints. 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 (ILP). Furthermore, the authors present an algorithm to lower bound the resource requirement of the time-constrained scheduling problem that enables them to solve the ILP more efficiently