THE SCHEDULING OF LARGE PROJECTS WITH LIMITED RESOURCES

Abstract

This study was prompted initially by the need for more effective methods of large project scheduling. Because most recent advances in this field have paid little explicit attention to the problem of limited resources, much of the effort was devoted to developing a theoretical system for dealing with project scheduling when resources are scarce. Different types of schedules were classified according to their properties; operations useful for generating and altering schedules extended the concepts of critical path analysis to the limited resource case--including the useful notion of slack. The concept of a critical sequence was developed and several theorems regarding its existence in certain types of schedules were proved.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 15, 1962
Accession Number
AD0469503

Entities

People

  • Jerome D. Wiest

Organizations

  • Carnegie Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies
  • Ground and Sea Platforms
  • Human Systems
  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Aircrafts
  • Algorithms
  • Business Administration
  • Computer Programming
  • Computer Programs
  • Computers
  • Critical Path Methods
  • Flow Network
  • Gantt Charts
  • Industrial Engineering
  • Integer Programming
  • Linear Programming
  • Manufacturing
  • Operations Research
  • Organizational Structure
  • Production Control
  • Systems Engineering

Readers

  • Economics
  • Graph Algorithms and Convex Optimization.
  • Logistics and Supply Chain Management.