Abstract
We develop a new analytical model for the time-cost trade-off problem via optimal control theory in Markov 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. Then, we construct a multi-objective optimal control problem, in which the first objective is the minimization of the total direct costs of the project, in which the direct cost of each activity is a non-decreasing function of the resources allocated to it, the second objective is the minimization of the mean of project completion time and the third objective is the minimization of the variance of project completion time. Finally, two multi-objective decision techniques, viz, goal attainment and goal programming are applied to solve this multi-objective optimal control problem and obtain the optimal resources allocated to the activities or the control vector of the problem
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Azaron, A. and S. Fatemi Ghomi. (2003). “Optimal Control of Service Rates and Arrivals in Jackson Networks.” European Journal of Operational Research, 147, 17–31.
Berman, E. (1964). “Resource Allocation in a PERT Network Under Continuous Activity Time-cost Function.” Management Science, 10, 734–745.
Burt, J. and M. Garman. (1977). “Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis.” Management Science, 18, 207–217.
Charnes, A., W. Cooper, and G. Thompson. (1964). “Critical Path Analysis via Chance Constrained and Stochastic Programming.” Operations Research, 12, 460–470.
Chau, D., W. Chan, and K. Govindan. (1997). “A Time-Cost Trade-Off Model with Resource Consideration Using Genetic Algorithm.” Civil Engineering Systems, 14, 291–311.
Clingen, C. (1964). “A Modification of Fulkerson’s Algorithm for Expected Duration of a PERT Project when Activities Have Continuous d.f.” Operations Research, 12, 629–632.
Demeulemeester, E., W. Herroelen, and S. Elmaghraby. (1993). “Optimal Procedures for the Discrete Time-Cost Trade-Off Problem in Project Networks.” Research Report, Department of Applied Economics, Katholieke Universiteit Leuven, Leuven, Belgium.
Elmaghraby, S. (1967). “On the Expected Duration of PERT Type Networks.” Management Science, 13, 299–306.
Elmaghraby, S. (1993). “Resource Allocation via Dynamic Programming in Activity Networks.” European Journal of Operational Research, 64, 199–245.
Falk, J. and J. Horowitz. (1972). “Critical Path Problem with Concave Cost Curves.” Management Science, 19, 446–455.
Fatemi Ghomi, S. and S. Hashemin. (1999). “A New Analytical Algorithm and Generation of Gaussian Quadrature Formula for Stochastic Network.” European Journal of Operational Research, 114, 610–625.
Fatemi Ghomi, S. and M. Rabbani. (2003). “A New Structural Mechanism for Reducibility of Stochastic PERT Networks.” European Journal of Operational Research, 145, 394–402.
Feng, C., L. Liu, and S. Burns. (1997). “Using Genetic Algorithms to Solve Construction Time-Cost Trade-Off Problems.” Journal of Construction Engineering and Management, ASCE, 11, 184–189.
Fishman, G. (1985). “Estimating Critical Path and Arc Probabilities in Stochastic Activity Networks.” Naval Research Logistic Quarterly, 32, 249–261.
Fulkerson, D. (1961). “A Network Flow Computation for Project Cost Curves.” Management Science, 7, 167–178.
Fulkerson, D. (1962). “Expected Critical Path Lengths in PERT Networks.” Operations Research, 10, 808–817.
Garman, M. (1972). “More on Conditioned Sampling in the Simulation of Stochastic Networks.” Management Science, 19, 90–95.
Golenko-Ginzburg, D. and A. Gonik. (1998). “A Heuristic for Network Project Scheduling with Random Activity Durations Depending on the Resource Reallocation.” International Journal of Production Economics, 55, 149–162.
Hwang, C. and A. Masud. (1979). Multiple Objective Decision Making, Methods and Applications. Berlin: Springer-Verlag.
Jordan, S. and C. Ku. (1997). “Access Control to Two Multiserver Loss Queue in Series.” IEEE Transactions on Automatic Control, 42, 1017–1023.
Kelly, J. (1961). “Critical Path Planning and Scheduling: Mathematical Basis.” Operations Research, 9, 296–320.
Kulkarni, V. and V. Adlakha. (1986). “Markov and Markov-Regenerative PERT Networks.” Operations Research, 34, 769–781.
Lamberson, L. and R. Hocking. (1970). “Optimum Time Compression in Project Scheduling.” Management Science, 16, 597–606.
Laslo, Z. (2003). “Activity Time-Cost Tradeoffs under Time and Cost Chance Constraints.” Computers and Industrial Engineering, 44, 365–384.
Luenberger, D. (1979). Introduction to Dynamic Systems. New York: John Wiley & Sons.
Martin, J. (1965). “Distribution of the Time Through a Directed Acyclic Network.” Operations Research, 13, 46–66.
Perry, C. and I. Creig. (1975). “Estimating the Mean and Variance of Subjective Distributions in PERT and Decision Analysis.” Management Science, 21, 1477–1480.
Pontrandolfo, P. (2000). “Project Duration in Stochastic Networks by the PERT-Path Technique.” International Journal of Project Management, 18, 215–222.
Robillard, P. (1976). “Expected Completion Time in PERT Networks.” Operations Research, 24, 177–182.
Robinson, D. (1965). “A Dynamic Programming Solution to Cost-Time Trade-Off for CPM.” Management Science, 22, 158–166.
Sethi, S. and G. Thompson. (1981). Optimal Control Theory. Boston: Martinus Nijhoff Publishing.
Sigal, C., A. Pritsker, and J. Solberg. (1979). “The Use of Cutsets in Monte-Carlo Analysis of Stochastic Networks.” Mathematical Simulation, 21, 376–384.
Schmit, C. and I. Grossmann. (2000). “The Exact Overall Time Distribution of a Project with Uncertain Task Durations.” European Journal of Operational Research, 126, 614–636.
Shioyama, T. (1991). “Optimal Control of a Queueing Network System with Two Types of Customers.” European Journal of Operational Research, 52, 367–372.
Tavares, L. (1987). “Optimal Resource Profiles for Program Scheduling.” European Journal of Operational Research, 29, 83–90.
Tseng, K. and M. Hsiao. (1995). “Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline.” Operations Research, 43, 89–101.
Weglarz, J. (1981). “Project Scheduling with Continuously Divisible Doubly Constrained Resources.” Management Science, 27, 1040–1053.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Azaron, A., Katagiri, H. & Sakawa, M. Time-cost trade-off via optimal control theory in Markov PERT networks. Ann Oper Res 150, 47–64 (2007). https://doi.org/10.1007/s10479-006-0149-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0149-x