SCHEDULING IN PROJECT NETWORKS

Abstract

Problems that involve a schedule or timetable of projected operations or jobs occur frequently in operations research. Three such scheduling problems were discussed in this survey. Each of these problems poses a question about a finite partially ordered set of jobs, a question that can, in each case, be reformulated in terms of flows in acyclic directed networks. Solution procedures for each problem are described.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1964
Accession Number
AD0601141

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programs
  • Computer Simulations
  • Computers
  • Construction
  • Critical Path Methods
  • Flow Network
  • Forward Areas
  • Integrals
  • Linear Programming
  • Numbers
  • Operations Research
  • Pert
  • Random Variables
  • Real Numbers
  • Scheduling (Production)

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Systems Analysis and Design