The Effect of Price Discount on Time-Cost Trade-off Problem Using Genetic Algorithm
- 1
- 2
Abstract
Time-cost trade off problem (TCTP), known in the literature as project crashing problem (PCP) and project speeding up problem (PSP) is a part of project management in planning phase. In this problem, determining the optimal levels of activity durations and activity costs which satisfy the project goal(s), leads to a balance between the project completion time and the project total cost. A large amount of literature has studied this problem under various behavior of cost function. But, in all of them, influence of discount has not been in-vestigated. Hence, in this paper, TCTP would be studied considering the influence of discount on the re-source price, using genetic algorithm (GA). The performance of proposed idea has been tested on a medium scale test problem and several computational experiments have been conducted to investigate the appropriate levels of proposed GA considering accuracy and computational time.
- W. Herroelen and R. Leus, “Project scheduling under uncertainty: Survey and research potentials,” European Journal of Operational Research, Vol. 165, pp. 289–306, 2005.
- R. A. Bowman, “Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation,” Annals of Operations Research, Vol. 53, pp. 533–551, 1994.
- G. Abbasi and A. M. Mukattash, “Crashing PERT networks using mathematical programming,” International Journal of Project Management, Vol. 19, pp. 181–188, 2001.
- S. Arisawa and S. E. Elmaghraby, “Optimal time-cost trade-offs in GERT networks,” Management Science, Vol. 18, pp. 589–599, 1972.
- L. V. Tavares, “A multi stage non-deterministic model for a project scheduling under resource consideration,” European Journal of Operational Research, Vol. 49, pp. 92–101, 1990.
- R. L. Bergman, “A heuristic procedure for solving the dynamic probabilistic project expediting problem,” European Journal of Operational Research, Vol. 192, pp. 125–137, 2009.
- S. Foldes and F. Soumis, “PERT and crashing revisited: Mathematical generalization,” European Journal of Operational Research, Vol. 64, pp. 286–294, 1993.
- L. Sunde and S. Lichtenberg, “Net-present value cost/ time trade off,” International Journal of Project Management, Vol. 13, pp. 45–49, 1995.
- W. J. Gutjahr, C. Strauss and E. Wagner, “A stochastic branch-and-bound approach to activity crashing in project management,” INFORMS Journal on Computing, Vol. 12, pp. 125–135, 2000.
- G. Mitchell and T. Klastorin, “An effective methodology for the stochastic project compression problem,” IIE Transaction, Vol. 39, pp. 957–969, 2007.
- A. Azaron, C. Perkgoz, and M. Sakawa, “A genetic algorithm approach for the time-cost trade-off in PERT networks,” Applied Mathematics and Computation, Vol. 168, pp. 1317–1339, 2005.
- A. Azaron and R. Tavakkoli-Moghaddam, “A multi objective resource allocation problem in dynamic PERT networks,” Applied Mathematics and Computation, Vol. 18, pp. 163–174, 2006.
- A. Azaron, H. Katagiri, and M. Sakawa, “Time-cost trade-off via optimal control theory in Markov PERT networks,” Annals of Operations Research, Vol. 150, pp. 47–64, 2007.
- P. C. Godinho and J. P. Costa, “A stochastic multimode model for time cost tradeoffs under management flexibility,” OR Spectrum, Vol. 29, pp. 311–334, 2007.