By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chaudhuri, S. ; Rensselaer Polytech. Inst., Troy, NY, USA ; Walker, R.A. ; Mitchell, J.

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

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993