An application of randomized minimum cut to the project time/cost tradeoff problem

Applied Mathematics and Computation

Volumn 173, Issue 2, 2006, Pages 1200-1207

  Tareghian, Hamed R ^a   Taheri, Hassan ^b  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

^b Khayam Institute of Higher Education   (Iran)

Author keywords

Project management; Randomized minimum cut

Indexed keywords

COSTS; GRAPH THEORY; PROBLEM SOLVING; PROJECT MANAGEMENT;

ACYCLIC GRAPH; RANDOMIZED MINIMUM CUT; TEST PROBLEMS;

RANDOM PROCESSES;

EID: 32644441687     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.04.063     Document Type: Article

References (5)

1. D.R. Fulkerson A network flow computation for project cost curve Manage. Sci. 7 2 1961 167 178
2. J.R. Kelly Jr. Critical path planning and scheduling: mathematical basis Operation Res. 9 3 1961 296 320
3. S. Phillips Jr. Project management duration/resource tradeoff analysis: an application of the cut search approach J. Operation. Res. Soc. 47 1996 697 701
4. D.R. Karger, Random sampling in graph optimization problems, Ph.D. Thesis, Stanford University, Stanford, CA 94305, 1994.
5. R. Kolisch, A. Sprecher, and A. Drexl Characterization and generation of a general class of resource constrained project scheduling problem Manage. Sci. 41 1995 1693 1703