An Heuristic Scheduling Algorithm for Resource-Constrained Project Networks

Abstract

An algorithm is proposed for scheduling project networks having a single constraining resource and a constant level of available resources. The algorithm seeks to generate a minimum length schedule indirectly by maximizing the average resource utilization over the two time intervals represented by the current decision point and its successor. An attempt is made to schedule all of the activities whose predecessors have been completed; failing this, all feasible subsets are considered. Where possible, the algorithm considers only those subsets which introduce new activities at the subsequent decision point.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1976
Accession Number
ADA031819

Entities

People

  • Stewart I. Marsh Jr.

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Bibliographies
  • Classification
  • Coast Guard
  • Gantt Charts
  • Heuristic Methods
  • Intervals
  • Operations Research
  • Project Management
  • Scheduling (Production)
  • Schools
  • Security
  • Theses
  • Time Intervals
  • United States

Fields of Study

  • Computer science

Readers

  • Economics
  • Operations Research