A comparative study of computational procedures for the resource constrained project scheduling problem

Abstract

Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the quality of solutions obtained by using these algorithms and reach conclusions about their relative merits on this specific problem. © 1994.