Sensitivity analysis for activity changes to project duration in CPM network

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice

Volumn 30, Issue 2, 2010, Pages 356-360

  Zhang, Li Hui ^a   Qi, Jian Xun ^a   Zhong, Gang ^a  

^a NORTH CHINA ELECTRIC POWER UNIVERSITY   (China)

Author keywords

CPM; Main path; Operations research; Project management; Sensitivity analysis

Indexed keywords

ACTIVITY DURATION; CPM; CRITICAL ACTIVITIES; CRITICAL PATHS; LONGEST PATH; MAIN PATH; PROJECT DURATION;

MANAGEMENT SCIENCE; OPERATIONS RESEARCH; PHASE MODULATION; PROJECT MANAGEMENT;

SENSITIVITY ANALYSIS;

EID: 77952395367     PISSN: 10006788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Cai C, Wan W. Critical chain project management based on PERT/CPM[J]. Chinese Journal of Management Science, 2003, 11(6): 35-39.
2. Xu J P, Hu Z N, Wang R. Operations Research[M]. Beijing: Science Press, 2007, 9: 129-136.
3. Bowman R A. Efficient sensitivity analysis of PERT network performance measures to significant changes in activity time parameters[J]. Journal of the Operational Research Society, 2007, 58(10): 1354-1360.
4. Meng Q, Wang X B. Sensitivity analysis of logit-based stochastic user equilibrium network flows with entry-exit toll schemes[J]. Computer-Aided Civil and Infrastructure Engineering, 2008, (23): 138-156.
5. Cho J G, Yum B J. Functional estimation of activity criticality indices and sensitivity analysis of expected project completion time[J]. Journal of the Operational Research Society, 2004, 55(8): 850-859.
6. Elmaghraby S E. On criticality and sensitivity in activity networks[J]. European Journal of Operational Research, 2000, 127: 220-238.
7. Li X M, Qi J X, Su Z X. Sensitivity analysis of single activity to its quantity of parallel activities based on activity float[J]. Operations Research and Management Science, 2008, 17(3): 154-159.
8. Zhang L H, Qi J X. Properties of node slack and applications in CPM networks[J]. Chinese Journal of Management Science, 2008, 16(5): 128-133.
9. Demeulemeester H. Project Scheduling: A Research Handbook[M]. Boston: Kluwer Academic Publishers, 2002: 111-112.
10. Chen S Q, Zhou H W. The second critical path method[J]. Systems Engineering - Theory & Practice, 1990, 10(3): 5-10.
11. Hershberger J, Suri S. Vickrey prices and shortest paths: What is an edge worth?[C]//Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001: 253-259.
12. Hershberger J, Suri S. Erratum to Vickrey prices and shortest paths: What is an edge worth?[C]//Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002: 809-810.
13. Ramaswamy R, James B O, Nilpal C. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs[J]. Mathematical Programming, 2005, 102: 355-369.
14. Enrico N, Guido P, Peter W. Finding the most vital node of a shortest path[J]. Theoretical Computer Science, 2003, 296: 167-177.
15. Nardelli E, Proietti G, Widmyer P. A faster computation of the most vital edge of a shortest path between two nodes[J]. Information Processing Letters, 2001, 79(2): 81-85.