Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T04:12:49.257Z Has data issue: false hasContentIssue false
  • English
  • Français

A discrete-time approximation technique for the time-cost trade-off in PERT networks

Published online by Cambridge University Press:  15 June 2007

Amir Azaron,
Masatoshi Sakawa,
Reza Tavakkoli-Moghaddam and
Nima Safaei
Amir Azaron
Affiliation:
Department of Industrial Engineering, Dalhousie University, Halifax, Nova Scotia, B3J 2X4 Canada; a.azaron@dal.ca
Masatoshi Sakawa
Affiliation:
Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, Hiroshima, 739-8527 Japan; sakawa@msl.sys.hiroshima-u.ac.jp
Reza Tavakkoli-Moghaddam
Affiliation:
Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran; tavakoli@ut.ac.ir
Nima Safaei
Affiliation:
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran; nimasafaei@iust.ac.ir
Get access

Abstract


We develop a discrete-time approximation technique dealing with the time-cost trade-off problem in PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. It is also assumed that the amount of resource allocated to each activity is controllable. Then, we construct an optimal control problem with three conflicting objective functions. Solving this optimal control problem, optimally, is impossible. Therefore, a discrete-time approximation technique is applied to solve the original multi-objective optimal control problem, using goal attainment method. To show the advantages of the proposed technique, we also develop a Simulated Annealing (SA) algorithm to solve the problem, and compare the discrete-time approximation results against the SA and also the genetic algorithm results.

Keywords

Project managementmultiple objective programmingoptimal controlmarkov processessimulated annealing.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 41 , Issue 1 , January 2007, pp. 61 - 81
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Azaron, A., Perkgoz, C. and Sakawa, M., Genetic Al, Agorithm Approach for the Time-Cost Trade-Off in PERT Networks. Appl. Math. Comput. 168 (2005) 1317–1339.
Azaron, A., Katagiri, H., Sakawa, M., Kato, K. and Memariani, A., Multi-objective Resource Al, Alocation Problem in PERT Networks. Eur. J. Oper. Res. 172 (2006) 838–854. CrossRef
Berman, E., Resource Allocation in a PERT Network Under Continuous Activity Time-cost Function. Management Sci. 10 (1964) 734–745. CrossRef
Burt, J. and Garman, M., Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis. Management Sci. 18 (1977) 207–217. CrossRef
Charnes, A., Cooper, W. and Thompson, G., Critical Path Analysis via Chance Constrained and Stochastic Programming. Oper. Res. 12 (1964) 460–470. CrossRef
Chau, D., Chan, W. and Govindan, K., Time-Cost Trade-Off Model, A with Resource Consideration Using Genetic Algorithm. Civil Engineering Systems 14 (1997) 291–311. CrossRef
Clingen, C., Modification, A of Fulkerson's Algorithm for Expected Duration of a PERT Project when Activities Have Continuous d. f. Oper. Res. 12 (1964) 629–632. CrossRef
E. Demeulemeester, W. Herroelen and S. Elmaghraby, Optimal Procedures for the Discrete Time-Cost Trade-Off Problem in Project Networks. Research Report, Department of Applied Economics, Katholieke Universiteit Leuven, Leuven, Belgium (1993).
Elmaghraby, S., On the Expected Duration of PERT Type Networks. Management Sci. 13 (1967) 299–306. CrossRef
Elmaghraby, S., Resource Allocation via Dynamic Programming in Activity Networks. Eur. J. Oper. Res. 64 (1993) 199–245. CrossRef
Falk, J. and Horowitz, J., Critical Path Problem with Concave Cost Curves. Management Sci. 19 (1972) 446–455. CrossRef
Fatemi Ghomi, S. and Hashemin, S., New Analytical Al, Agorithm and Generation of Gaussian Quadrature Formula for Stochastic Network. Eur. J. Oper. Res. 114 (1999) 610–625. CrossRef
Fatemi Ghomi, S. and Rabbani, M., New St, Aructural Mechanism for Reducibility of Stochastic PERT Networks. Eur. J. Oper. Res. 145 (2003) 394–402. CrossRef
C. Feng, L. Liu, and S. Burns, Using Genetic Algorithms to Solve Construction Time-Cost Trade-Off Problems. J. Construction Engineering and Management, ASCE 11 (1997) 184–189.
Fishman, G., Estimating Critical Path and Arc Probabilities in Stochastic Activity Networks. Naval Res. Logistic Quarterly 32 (1985) 249–261. CrossRef
Fulkerson, D., Network Flow Computation, A for Project Cost Curves. Management Sci. 7 (1961) 167–178. CrossRef
Fulkerson, D., Expected Critical Path Lengths in PERT Networks. Oper. Res. 10 (1962) 808–817. CrossRef
Garman, M., More on Conditioned Sampling in the Simulation of Stochastic Networks. Management Sci. 19 (1972) 90–95. CrossRef
Golenko-Ginzburg, D. and Gonik, A., Heuristic, A for Network Project Scheduling with Random Activity Durations Depending on the Resource Reallocation. Inter. J. Production Economics 55 (1998) 149–162. CrossRef
K. Gutzmann, Combinatorial Optimization Using a Continuous State Boltzmann Machine. Proceedings of IEEE First Int. Conf. Neural Networks, Vol. III, San Diego, CA (1987) 721–728.
Kelly, J., Critical Path Planning and Scheduling: Mathematical Basis. Oper. Res. 9 (1961) 296–320. CrossRef
Kirkpatrick, S., Gelatt, J. and Vecchi, M., Optimization by Simulated Annealing. Science 220 (1983) 671–680. CrossRef
Koulamas, C., Antony, S. and Jaen, R., Survey, A of Simulated Annealing Applications to Operations Research Problems. Omega 22 (1994) 41–56. CrossRef
Kulkarni, V. and Adlakha, V., Markov and Markov-Regenerative PERT Networks. Oper. Res. 34 (1986) 769–781. CrossRef
Lamberson, L. and Hocking, R., Optimum Time Compression in Project Scheduling. Management Sci. 16 (1970) 597–606. CrossRef
Laslo, Z., Activity Time-Cost Tradeoffs under Time and Cost Chance Constraints. Comput. Industrial Engineering 44 (2003) 365–384. CrossRef
Martin, J., Distribution of the Time Through a Directed Acyclic Network. Oper. Res. 13 (1965) 46–66. CrossRef
M. Neuts, Matrix-geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, MD (1981).
Perry, C., Creig, I., Estimating the Mean and Variance of Subjective Distributions in PERT and Decision Analysis. Management Sci. 21 (1975) 1477–1480. CrossRef
Pontrandolfo, P., Project Duration in Stochastic Networks by the PERT-Path Technique. Inter. J. Project Management 18 (2000) 215–222. CrossRef
P. Robillard, Expected Completion Time in PERT Networks. Oper. Res. 24, (1976) 177–182.
Robinson, D., Dynamic Programming Solution, A to Cost-Time Trade-Off for CPM. Management Sci. 22 (1965) 158–166. CrossRef
S. Sethi, and G. Thompson, Optimal Control Theory. Martinus Nijhoff Publishing, Boston (1981).
Sigal, C., Pritsker, A. and Solberg, J., The Use of Cutsets in Monte-Carlo Analysis of Stochastic Networks. Mathematical Simulation 21 (1979) 376–384. CrossRef
Schmit, C., and Grossmann, I., The Exact Overall Time Distribution of a Project with Uncertain Task Durations. Eur. J. Oper. Res. 126 (2000) 614–636. CrossRef
Tavares, L., Optimal Resource Profiles for Program Scheduling. Eur. J. Oper. Res. 29 (1987) 83–90. CrossRef
Weglarz, J., Project Scheduling with Continuously Divisible Doubly Constrained Resources. Management Sci. 27 (1981) 1040–1053. CrossRef