| 用最短路径法求关键路线及其SAS的实施 |
| |
| 引用本文： | 舒兴明. 用最短路径法求关键路线及其SAS的实施[J]. 广西大学学报(自然科学版), 2002, 27(1): 79-82 |
| |
| 作者姓名： | 舒兴明 |
| |
| 作者单位： | 华南热带农业大学,经贸学院,海南,儋州,571737 |
| |
| 摘 要： | 利用网络工程的关键路线为耗期最长的特点，将其按照一定的规则转化成最短路径问题，然后利用求最短路径的SAS程序，顺利地求出网络工程的关键路线。
|
| 关 键 词： | 最短路径法 关键路线 SAS／OR 网络工程 网络图 有向图 SAS程序 工作链 |
| 文章编号： | 1001-7445(2002)01-0079-04 |
| 修稿时间： | 2001-10-28 |
Solve the critical path problem by the shortest path method |
| |
| SHU Xing ming. Solve the critical path problem by the shortest path method[J]. Journal of Guangxi University(Natural Science Edition), 2002, 27(1): 79-82 |
| |
| Authors: | SHU Xing ming |
| |
| Abstract: | The critical path problem is transformed to the shortest path problem according to the time limit for a project being the summation of the critical path.And the critical path problem is solved successfully by the shortest path procedure in software of SAS/OR/netflow. |
| |
| Keywords: | net work critical path shortest path SAS/OR |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
