Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
This paper introduces a solution procedure for solving the project time/cost tradeoff problem of reducing a project duration at a minimum cost. The solution to the time/cost problem is achieved by locating a minimal cut in a flow network derived from the original project network. This minimal cut is then utilized to identify the project activities which should experience a duration modification in order to achieve the total project reduction. The paper will document this cut-based procedure and provide a practical application to a project situation.
Year of publication: |
1977
|
---|---|
Authors: | Steve Phillips, Jr. ; Dessouky, Mohamed I. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 24.1977, 4, p. 393-400
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The Cut Search Algorithm with Arc Capacities and Lower Bounds
Steve Phillips, Jr., (1979)
-
Flowshop scheduling with identical jobs and uniform parallel machines
Dessouky, Maged M., (1998)
-
Dessouky, Mohamed I., (1998)
- More ...