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

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.