Abstract
For the time–cost tradeoff problem, if the involved super large-scale CPM network is simplified, then any correlative algorithm which used to solve the problem is simplified too. According to the idea, firstly, property of free float and relation of free float and path length is analyzed, and some new conceptions and free float theorem are deduced; secondly, an algorithm of simplifying the super large-scale network in time–cost tradeoff problem is designed by using these conceptions and the theorem, and validity of the algorithm is proved; finally, application of the algorithm is discussed by illustration. The theoretic proof and illustration show that if the algorithm is used to simplify the time–cost tradeoff problem, any correlative algorithm which used to solve the problem could be greatly simplified.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yang J (1995) Construction project schedule control. Earthquake Publisher, Beijing (In Chinese)
Zhang JW, Xu Y, He ZW et al (2007) A review on the time/cost trade-offs problem in project scheduling. Journal of Industrial Engineering and Engineering Management 1:92–97
Zhang JW, Xu Y, He ZW et al (2006) Discrete time/cost trade-offs in project scheduling with time-switch constraints. Chinese Journal of Management Science 2:58–64
Wu XL, Yin Z (2007) Solving time-cost trade-off model for activity network by minimum cost flow principle. Journal of Huazhong University of Science and Technology (Nature Science Edition) 1:42–45
Szmerekovsky JG, Venkateshan P (2012) An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs. Computers and Operations Research 39:1402–1410
Mokhtari H, Kazemzadeh RB, Salmasnia A (2011) Time-cost tradeoff analysis in project management: An ant system approach. IEEE Transactions on Engineering Management 5:36–43
Yang IT (2011) Stochastic time-cost tradeoff analysis: A distribution-free approach with focus on correlation and stochastic dominance. Automation in Construction 20:916–926
Hazir O, Haouari M, Erel E (2010) Robust scheduling and robustness measures for the discrete time/cost trade-off problem. European Journal of Operational Research 207:633–643
Klerides E, Hadjiconstantinou E (2010) A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations. Computers & Operations Research 37:2131–2140
Anagnostopoulos KP, Kotsikas L (2010) Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem. Applied Mathematics and Computation 217:260–270
Elmaghraby SE (2000) On criticality and sensitivity in activity networks. European Journal of Operational Research 127:220–238
Elmaghraby SE (1995) Activity nets: A guided tour through some recent developments. European Journal of Operational Research 82:383–408
Elmaghraby SE (1977) Activity networks: Project planning and control by network models. Wiley publisher, New York
Elmaghraby SE, Kamburowski J (1990) On project representation and activity floats. Arabian Journal of Science and Engineering 15:627–637
Liu ZY (2002) Discussion of ‘time-cost tradeoff’ optimization by using network planning technology. Construction & Design For Project 3:13–14
Fulkerson DR (1964) Scheduling in project networks. Tech. Report RAND memo (RM-4137 PR, RAND Corporation), Santa Monica
Wei GH, Fu JL, Zhou ZL (1987) Applied operational research. Fudan University Publisher, Shanghai (In Chinese)
Zhong W, Yin ZW, Lou N (2001) A new optimizing algorithm for the time-cost project network. Journal of Fudan University 40:456–460 (In Chinese)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Su, Z., Qi, J., Kan, Z. (2014). Simplification of Large Scale Network in Time–cost Tradeoff Problem. In: Xu, J., Fry, J., Lev, B., Hajiyev, A. (eds) Proceedings of the Seventh International Conference on Management Science and Engineering Management. Lecture Notes in Electrical Engineering, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40078-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-40078-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40077-3
Online ISBN: 978-3-642-40078-0
eBook Packages: Business and EconomicsBusiness and Management (R0)