Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2015, Article ID 539374, 17 pages
http://dx.doi.org/10.1155/2015/539374
Research Article

A Float-Path Theory and Its Application to the Time-Cost Tradeoff Problem

1Business Administration College, Nanchang Institute of Technology, Nanchang 330099, China
2School of Economics and Management, North China Electric Power University, Beijing 102206, China

Received 11 September 2014; Accepted 2 February 2015

Academic Editor: Quanke Pan

Copyright © 2015 Zhi-xiong Su et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. E. Kelley and M. R. Walker, “Critical-path planning and scheduling,” in Proceedings of the Eastern Joint IRE-ACM Computer Conference, pp. 160–173, December 1959. View at Publisher · View at Google Scholar
  2. T. Warren, “Four oat measures for critical path scheduling,” Journal of Industrial Engineering, vol. 10, pp. 19–23, 1969. View at Google Scholar
  3. A. Battersby, Network Analysis for Planning and Scheduling, John Wiley & Sons, New York, NY, USA, 1970.
  4. S. E. Elmaghraby and J. Kamburowski, “On project representation and activity oats,” Arabian Journal of Science and Engineering, vol. 15, pp. 625–637, 1990. View at Google Scholar
  5. S. E. Elmaghraby, “Activity nets: a guided tour through some recent developments,” European Journal of Operational Research, vol. 82, no. 3, pp. 383–408, 1995. View at Publisher · View at Google Scholar · View at Scopus
  6. D. R. Fulkerson, “A network flow computation for project cost curves,” Management Science, vol. 7, no. 2, pp. 167–178, 1961. View at Google Scholar · View at MathSciNet
  7. J. Kelley, “Critical-path planning and scheduling: mathematical basis,” Operations Research, vol. 9, no. 3, pp. 296–320, 1961. View at Publisher · View at Google Scholar · View at MathSciNet
  8. D. Panagiotakoplos, “A CPM time-cost computational algorithm for arbitrary activity cost function,” INFOR, vol. 15, no. 2, pp. 183–195, 1977. View at Google Scholar
  9. J. J. Moder, C. R. Phillips, and E. W. Davis, Project Management with CPM, PERT and Precedence Diagramming, Van Nostrand Reinhold, New York, NY, USA, 1983.
  10. J. E. Falk and J. L. Horowitz, “Critical path problem with concave cost-time curve,” Management Science, vol. 19, no. 4, pp. 446–455, 1972. View at Publisher · View at Google Scholar · View at Scopus
  11. L. R. Lamberson and R. R. Hocking, “Optimum time compression in project scheduling,” Management Science, vol. 16, no. 10, pp. 597–606, 1970. View at Publisher · View at Google Scholar · View at Scopus
  12. K. C. Kapur, “An algorithm for the project cost/duration analysis problem with quadratic and convex cost functions,” IIE Transactions, vol. 5, no. 4, pp. 314–322, 1973. View at Publisher · View at Google Scholar
  13. N. Siemens and C. Gooding, “Reducing project duration at minimum cost: a time-cost tradeoff algorithm,” Omega, vol. 3, no. 5, pp. 569–581, 1975. View at Publisher · View at Google Scholar · View at Scopus
  14. S. E. Elmaghraby and A. Salem, “Optimal project compression under convex cost functions I: quadratic cost with continuous derivative,” OR Technical Report 157, North Carolina State University, Raleigh, NC, USA, 1980. View at Google Scholar
  15. S. E. Elmaghraby and A. Salem, “Optimal project compression under convex cost functions II,” OR Technical Report 158, North Carolina State University, Raleigh, NC, USA, 1980. View at Google Scholar
  16. S. E. Elmaghraby and J. Kamburowski, “The analysis of activity networks under generalized precedence relations (GPRs),” Management Science, vol. 38, no. 9, pp. 1245–1263, 1992. View at Publisher · View at Google Scholar
  17. K. Choi and Y. H. Kwak, “Decision support model for incentives/disincentives time-cost tradeoff,” Automation in Construction, vol. 21, no. 1, pp. 219–228, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. R. F. Deckro, J. E. Hebert, W. A. Verdini, P. H. Grimsrud, and S. Venkateshwar, “Nonlinear time/cost tradeoff models in project management,” Computers and Industrial Engineering, vol. 28, no. 2, pp. 219–229, 1995. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Azaron and R. Tavakkoli-Moghaddam, “Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach,” European Journal of Operational Research, vol. 180, no. 3, pp. 1186–1200, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. N. Halman, C.-L. Li, and D. Simchi-Levi, “Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks,” Operations Research Letters, vol. 37, no. 4, pp. 239–244, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. D. S. Yamashita and R. Morabito, “A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs,” International Journal of Operational Research, vol. 5, no. 4, pp. 429–444, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. B. K. Pathak and S. Srivastava, “Integrated ANN-HMH approach for nonlinear time-cost tradeoff problem,” International Journal of Computational Intelligence Systems, vol. 7, no. 3, pp. 456–471, 2014. View at Publisher · View at Google Scholar · View at Scopus
  23. M. Li and G. D. Wu, “Robust optimization for time-cost tradeoff problem in construction projects,” Abstract and Applied Analysis, vol. 2014, Article ID 926913, 7 pages, 2014. View at Publisher · View at Google Scholar
  24. R. T. Harvey and J. H. Patterson, “An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis,” Foundations of Control Engineering, vol. 4, no. 2, pp. 107–117, 1979. View at Google Scholar · View at MathSciNet
  25. P. De, J. E. Dunne, J. B. Ghosh, and C. E. Wells, “Complexity of the discrete time-cost tradeoff problem for project networks,” Operations Research, vol. 45, no. 2, pp. 302–306, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. Skutella, “Approximation algorithms for the discrete time-cost tradeoff problem,” Mathematics of Operations Research, vol. 23, no. 4, pp. 909–929, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. C. Akkan, A. Drexl, and A. Kimms, “Network decomposition-based benchmark results for the discrete time-cost tradeoff problem,” European Journal of Operational Research, vol. 165, no. 2, pp. 339–358, 2005. View at Publisher · View at Google Scholar · View at Scopus
  28. M. Vanhoucke, “New computational results for the discrete time/cost trade-off problem with time-switch constraints,” European Journal of Operational Research, vol. 165, no. 2, pp. 359–374, 2005. View at Publisher · View at Google Scholar · View at Scopus
  29. K. P. Anagnostopoulos and L. Kotsikas, “Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem,” Applied Mathematics and Computation, vol. 217, no. 1, pp. 260–270, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. H. Mokhtari, R. B. Kazemzadeh, and A. Salmasnia, “Time-cost tradeoff analysis in project management: an ant system approach,” IEEE Transactions on Engineering Management, vol. 58, no. 1, pp. 36–43, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. E. N. Afruzi, E. Roghanian, A. A. Najafi, and M. Mazinani, “A multi-mode resource-constrained discrete time-cost tradeoff problem solving using an adjusted fuzzy dominance genetic algorithm,” Scientia Iranica, vol. 20, no. 3, pp. 931–944, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. S. Parveen and S. K. Saha, “A GA-based fuzzy optimal model for time-cost trade-off in a project with resources consideration,” International Journal of Industrial and Systems Engineering, vol. 15, no. 2, pp. 153–170, 2013. View at Publisher · View at Google Scholar · View at Scopus
  33. N. Glišović, “Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeo,” Journal of Applied Mathematics, vol. 2014, Article ID 817921, 12 pages, 2014. View at Publisher · View at Google Scholar
  34. M.-Y. Cheng and D.-H. Tran, “Two-phase differential evolution for the multiobjective optimization of time-cost tradeoffs in resource-constrained construction projects,” IEEE Transactions on Engineering Management, vol. 61, no. 3, pp. 450–461, 2014. View at Publisher · View at Google Scholar
  35. J. G. Szmerekovsky and P. Venkateshan, “An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs,” Computers & Operations Research, vol. 39, no. 7, pp. 1402–1410, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. P. De, E. J. Dunne, J. B. Ghosh, and C. E. Wells, “The discrete time-cost tradeoff problem revisited,” European Journal of Operational Research, vol. 81, no. 2, pp. 225–238, 1995. View at Publisher · View at Google Scholar · View at Scopus
  37. E. L. Demeulemeester and W. S. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic Publishers, London, UK, 2002.
  38. S. S. Erenguc, T. Ahn, and D. G. Conway, “The resource constrained project scheduling problem with multiple crashable modes: an exact solution method,” Naval Research Logistics, vol. 48, no. 2, pp. 107–127, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  39. Ö. Hazır, M. Haouari, and E. Erel, “Robust scheduling and robustness measures for the discrete time/cost trade-off problem,” European Journal of Operational Research, vol. 207, no. 2, pp. 633–643, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus