Network‐based project planning and scheduling

Discusses the twofold purpose of this study, first to introduce a number of measures devised to be used in comparing and evaluating two schedules for the same project, second to present and evaluate a heuristic procedure developed in this research for solving the resource constrained project scheduling problem. Posits that the new procedure is based on the notion that a project can be partitioned into a number of sections and there is no obligation to use a single policy all the way through all the sections of project. Shows that this research is also an attempt to bridge the gap between the theory and practice by eliminating the question of which priority rule to use for which project. Develops a new model showing that selecting from a number of priority rules is not required and, using the measures of performance introduced, decides on a suitable schedule from the schedules produced under varied assumptions is shown to be much easier. Concludes with suggestions for further research.