DECISION NETWORK PLANNING MODELS

Abstract

The thesis develops project planning models that allow the possibility of specifying alternate ways of performing any of the jobs in the project. The 'job alternatives' for any task may have different times, costs, resource requirements and possibly different precedence relations with other jobs in the project network. The problem is to select the particular way in which each job will be performed and schedule the resulting jobs so as to minimize the cost of the jobs plus the cost associated with the completion date of the project. The problem of selecting the optimal job alternatives in networks with no resource constraints is formulated as an integer programming problem. To show the generality of the planning model developed, the integer programming formulation of the project problem was adapted to the m x n job-shop scheduling problem, the single product assembly-line balancing problem and the problem of planning projects under incentive contracts.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1968
Accession Number
AD0673528

Entities

People

  • Wallace B. Crowston

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Assembly
  • Assembly Lines
  • Computations
  • Computer Programming
  • Contracts
  • Engineering
  • Gantt Charts
  • Heuristic Methods
  • Incentive Contracts
  • Industrial Engineering
  • Integer Programming
  • Job Shop Scheduling
  • Mathematical Programming
  • Military Research
  • Operations Research

Readers

  • Industrial Economics
  • Instructional Design and Training Evaluation.
  • Operations Research