| Optimization of PERT Network and Compression of Time |
| |
| 作者姓名： | 李平 胡建兵 顾新一 |
| |
| 作者单位： | [1]School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China [2]Department of Economics and Management, Luoyang College of Technology, Luoyang 471003, China |
| |
| 摘 要： | In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.
|
| 关 键 词： | 网络优化 计算机 程序评审技术 PERT |
| 文章编号： | 1005-2429（2005）02-0161-06 |
| 收稿时间： | 2004-11-11 |
Optimization of PERT Network and Compression of Time |
| |
| Li Ping,Hu Jianbing,Gu Xinyi.Optimization of PERT Network and Compression of Time[J].Journal of Southwest Jiaotong University,2005,13(2):161-166. |
| |
| Authors: | Li Ping Hu Jianbing Gu Xinyi |
| |
| Abstract: | In the traditional methods of program evaluation and review technique (PERT) network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn: (1) compression of time is restricted by cost ratio and completion probability of project; (2) activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; (3) there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker's preference. |
| |
| Keywords: | Time compression for project Network optimization Dependent-chance programming Genetic algorithms PERT network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
