Procedures for Heuristic Scheduling under Limited Resources in Activity Networks

摘要

This is the documentation of a program that permits the analyst to choose any one of three priority rules of schedule activities under conditions of limited resources. The program is written in FORTRAN. We give the logic of the programs, a flowchart representation, and a printout of the instructions (upon request). Also, a solved sample problem is included. This program is available at a nominal fee from the Graduate Program in Operations Research, NC State University, PO Box 5511, Raleigh, NC 27650. (Author)