ALGORITHMS FOR SCHEDULING PROJECTS WITH LIMITED RESOURCES

During recent years decision procedures for scheduling projects with limited resources have become more complex. It is therefore, desirable to allow for more aspects of the real world when developing such procedures. The present paper begins with a brief survey of the manner in which the above scheduling problem has heretofore been defined and solved. Next, this problem is reformulated in order to allow for the treatment of predicted streams of costs and benefits of a project, as a function of calendar time. The method developed in this paper consists of two algorithms. Application of the first algorithm results in a good initial solution to the scheduling problem and is, therefore, a heuristic procedure. Next, a second algorithm which guarantees an optimal solution is applied to this initial solution. Computational experience with the aforementioned two algorithms indicates that their combined application is an efficient method for scheduling projects with limited resources.

  • Corporate Authors:

    American Society for Engineering Education

    300 West Chestnut Street
    Ephrata, PA  USA  17522
  • Authors:
    • BEENHAKKER, H L
    • Narayanan, V
  • Publication Date: 1975-12

Media Info

  • Features: Appendices; Figures; References; Tables;
  • Pagination: p. 119-140
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00131583
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 11 1976 12:00AM