OPTIMUM TIME COMPRESSION IN PROJECT SCHEDULING.

Abstract

An algorithm based on convex programming is developed for optimum time compression in network scheduling systems. The development allows for the activity time-cost trade-off functions to be any continuous differentiable convex function. Decomposition theory is then applied to reduce the amount of computation necessary. This along with a limited number of rules to structure any incoming vector makes the algorithm amenable to time compression in large project networks. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 02, 1968
Accession Number
AD0672363

Entities

People

  • L. R. Lamberson
  • R. R. Hocking

Organizations

  • Texas A&M University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Compression
  • Computations
  • Computer Programming
  • Convex Programming
  • Decomposition
  • Heuristic Methods
  • Mathematical Analysis
  • Mathematics
  • Scheduling (Production)
  • Time Compression

Fields of Study

  • Computer science

Readers

  • Operations Research