Disjunctive Graph Algorithms for Average Flow Time and Average Tardiness.

摘要

Several new algorithms using disjunctive networks are developed for the resource constrained scheduling problem. The algorithms employ as objective functions the riteria of average flow time and average tardiness which have received little attention previously. Extensions to multiple criteria objective functions are discussed. (Author)