Simplification of Large Scale Network in Time–cost Tradeoff Problem

  • Zhixiong Su
  • Jianxun Qi
  • Zhinan Kan
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 241)


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.


CPM network planning Time–cost trade off problem Free float theorem Simplification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yang J (1995) Construction project schedule control. Earthquake Publisher, Beijing (In Chinese)Google Scholar
  2. 2.
    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–97Google Scholar
  3. 3.
    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–64Google Scholar
  4. 4.
    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–45Google Scholar
  5. 5.
    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–1410Google Scholar
  6. 6.
    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–43Google Scholar
  7. 7.
    Yang IT (2011) Stochastic time-cost tradeoff analysis: A distribution-free approach with focus on correlation and stochastic dominance. Automation in Construction 20:916–926Google Scholar
  8. 8.
    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–643Google Scholar
  9. 9.
    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–2140Google Scholar
  10. 10.
    Anagnostopoulos KP, Kotsikas L (2010) Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem. Applied Mathematics and Computation 217:260–270Google Scholar
  11. 11.
    Elmaghraby SE (2000) On criticality and sensitivity in activity networks. European Journal of Operational Research 127:220–238Google Scholar
  12. 12.
    Elmaghraby SE (1995) Activity nets: A guided tour through some recent developments. European Journal of Operational Research 82:383–408Google Scholar
  13. 13.
    Elmaghraby SE (1977) Activity networks: Project planning and control by network models. Wiley publisher, New YorkGoogle Scholar
  14. 14.
    Elmaghraby SE, Kamburowski J (1990) On project representation and activity floats. Arabian Journal of Science and Engineering 15:627–637Google Scholar
  15. 15.
    Liu ZY (2002) Discussion of ‘time-cost tradeoff’ optimization by using network planning technology. Construction & Design For Project 3:13–14Google Scholar
  16. 16.
    Fulkerson DR (1964) Scheduling in project networks. Tech. Report RAND memo (RM-4137 PR, RAND Corporation), Santa MonicaGoogle Scholar
  17. 17.
    Wei GH, Fu JL, Zhou ZL (1987) Applied operational research. Fudan University Publisher, Shanghai (In Chinese)Google Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.School of Economics and ManagementNorth China Electric Power UniversityBeijingPeople’s Republic of China

Personalised recommendations