Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

Linus Schrage
Additional contact information
Linus Schrage: University of Chicago, Chicago, Illinois

Operations Research, 1970, vol. 18, issue 2, 263-278

Abstract: This paper considers a scheduling problem that has both precedence constraints (of a general form as in PERT-CPM problems) and resource constraints (of the form in the general job-shop scheduling problem), and gives an efficient enumerative procedure for generating all active schedules for this problem. Based on this enumerative scheme, the paper describes a branch-and-bound method for implicitly enumerating all schedules and determining the optimum; finally, it gives computational experience for the problem where the objective is minimizing the project makespan.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.2.263 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:2:p:263-278

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().