Project Scheduling and Resource Leveling: An Algorithmic-Interactive Procedure

摘要

A mathematical model of the resource-constrained scheduling problem is presented. An algorithmic-interactive procedure for solving the problem is developed because the combinatorics of the mathematical model prevent an analytical solution. The procedure is shown to be a viable technique when applied to a scheduling and resource allocation problem at Lawrence Livermore Laboratory. 2 figures. (ERA citation 03:009487)