Accession Number:

AD0673528

Title:

DECISION NETWORK PLANNING MODELS

Descriptive Note:

Research rept.

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s):

Report Date:

1968-05-01

Pagination or Media Count:

213.0

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.

Subject Categories:

  • Administration and Management
  • Operations Research
  • Manufacturing and Industrial Engineering and Control of Production Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE