You are here

Activity modes selection for project crashing through deterministic simulation

Journal Name:

Publication Year:

DOI: 
http://dx.doi.org/10.3926/jiem.224
Abstract (2. Language): 
for project crashing through deterministic simulation Ashok Mohanty1, Jibitesh Mishra1 , Biswajit Satpathy2 1 College of Engineering and Technology Bhubaneswar, 2Sambalpur University (INDIA) amohanty01 @yahoo.com; mishrajibitesh@gmail.com; satpathybulu@gmail.com Received July 2010 Accepted November 2011 Abstract: Purpose: The time-cost trade-off problem addressed by CPM-based analytical approaches, assume unlimited resources and the existence of a continuous timecost function. However, given the discrete nature of most resources, the activities can often be crashed only stepwise. Activity crashing for discrete time-cost function is also known as the activity modes selection problem in the project management. This problem is known to be NP-hard. Sophisticated optimization techniques such as Dynamic Programming, Integer Programming, Genetic Algorithm and Ant Colony Optimization have been used for finding efficient solution to activity modes selection problem. The paper presents a simple method that can provide efficient solution to activity modes selection problem for project crashing. Design/methodology/approach: Simulation based method implemented on electronic spreadsheet to determine activity modes for project crashing. The method is illustrated with the help of an example. Findings: The paper shows that a simple approach based on simple heuristic and deterministic simulation can give good result comparable to sophisticated optimization techniques.Research limitations/implications: The simulation based crashing method presented in this paper is developed to return satisfactory solutions but not necessarily an optimal solution. Practical implications: The use of spreadsheets for solving the Management Science and Operations Research problems make the techniques more accessible to practitioners. Spreadsheets provide a natural interface for model building, are easy to use in terms of inputs, solutions and report generation, and allow users to perform what-if analysis. Originality/value: The paper presents the application of simulation implemented on a spreadsheet to determine efficient solution to discrete time cost tradeoff problem.
610-623

REFERENCES

References: 

Burns, S.A., Liu, L., & Feng, C.W. (1996). The LP/IP hybrid method for construction time-cost trade-off analysis. Construction Management and Economics, 14(3), 265-276. http://dx.doi.org/10.1080/014461996373511
De, P., Dunne, E.J., Ghosh, J.B., & Wells, C.E. (1997). Complexity of the discrete time/cost trade-off problem for project networks. Operations Research, 45, 302¬306. http://dx.doi.org/10.1287/opre.45.2.302
Kelley, J.E. (1961). Critical Path planning and scheduling: Mathematical basis. Operations Research, 9(3), 296-320.
Moder, J.J., Phillips, C.R., & Davis, E.W. (1983). Project management with CPM, PERT and precedence diagramming (3rd Ed). New York: Van Nostrand Reinhold.
Panagiotakopouols, D. (1977). Cost-time model for large cpm project networks. Construction Engineering and Management, ASCE, 103(C02), 201-211.
Rahimi, M., & Iranmanesh, H. (2008). Multi objective particle swarm optimization for a discrete time, cost and quality trade -off problem. World Applied Sciences
Journal, 4(2), 270-276.
Seal, K.C. (2001). A generalized PERT/CPM implementation in a spreadsheet. INFORMS Transactions on Education, 2(1), 16-26. http://dx.doi.org/10.1287/ited.2.1.16
Skutella, M. (1998). Approximation Algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research, 23(4), 909-929. http://dx.doi.org/10.1287/moor.23.4.909
Sunde, L. & Lichtenberg, S. (1995). Net-present-value cost/time tradeoff. International Journal of Project Management, 13(1), 45-49. http://dx.doi.org/10.1016/0263-7863(95)95703-G
Tareghian, H.R., & Taheri, S.H. (2006). On discrete time, cost and quality trade-off problem. Applied Mathematics and Computation, 181, 1305-1312. http://dx.doi.org/10.1016/j.amc.2006.02.029
Wiest, J.D., & Levy, F.K. (1977). A Management Guide to PERT/CPM. Prentice-Hall.
Yau, C., & Ritchie, E. (1990). Project Compression: A Method for speeding up resource constrained projects which preserve the activity schedule. EuropeanJournal
of Operational Research, 49(1), 140-152. http://dx.doi.org/10.1016/0377- 2217(90)90125-U

Thank you for copying data from http://www.arastirmax.com