A Critique of Project Planning under Constrained Resources.

Abstract

The paper surveys the current research in resource constrained project scheduling. Although CPM and PERT have gained wide acceptance and use, the problem of limiting resources used by each activity remains unsolved for practical sized problems. The past research follows three basic approaches. The problem may be formulated as an integer linear program and solved by standard integer programming techniques. A second approach is to directly employ some enumerative scheme for constructing an optimal schedule. Finally, the problem may be formulated in terms of minimaximal paths in a disjunctive graph and solved by network flow methods and implicit enumeration. The approaches are compared and the essential difficulties of the several methods are identified. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 15, 1972
Accession Number
AD0750257

Entities

People

  • Gerald E. Bennington
  • Leon F. Mcginnis

Organizations

  • North Carolina State University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Gantt Charts
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Management Engineering
  • Management Planning And Control
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Pert
  • Scheduling (Production)
  • Standards

Readers

  • Operations Research