Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm

G. E. Bennington and L. F. McGinnis
Additional contact information
G. E. Bennington: The Mitre Corporation, McLean, Virginia
L. F. McGinnis: North Carolina State University, Raleigh, North Carolina

Operations Research, 1974, vol. 22, issue 5, 1117-1119

Abstract: The purpose of this note is to propose a simpler feasibility criterion for the disjunctive-graph model proposed by Balas and implemented by Gorenstein in an algorithm for resource-constrained project scheduling.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.5.1117 (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:22:y:1974:i:5:p:1117-1119

Access Statistics for this article

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