| 多资源约束的网络计划的启发式优化方法 |
| |
| 引用本文： | 白思俊. 多资源约束的网络计划的启发式优化方法[J]. 系统工程理论与实践, 1995, 15(7): 42-47. DOI: 10.12011/1000-6788(1995)7-42 |
| |
| 作者姓名： | 白思俊 |
| |
| 作者单位： | 西北工业大学管理学院 |
| |
| 摘 要： | 多资源约束的网络计划的启发式优化方法白思俊（西北工业大学管理学院，西安７１００７２）ＨｅｕｒｉｓｔｉｃＭｅｔｈｏｄｆｏｒＭｕｌｔｉｐｌｅＲｅｓｏｕｒｃｅ－ＣｏｎｓｔｒａｉｎｅｄｉｎＰＥＲＴ／ＣＰＭＮｅｔｗｏｒｋＢａｉＳｉｊｕｎ（ＭａｎａｇｅｍｅｎｔＳ...
|
| 关 键 词： | 网络计划 多资源约束 启发式优化方法 最短工期 多资源均衡 紧后工作 强度系数 要量 层次分析法 计算机辅助分析 |
| 收稿时间： | 1992-10-19 |
Heuristic Method for Multiple Resource-Constrained in PERT/CPM Network |
| |
| Bai Sijun. Heuristic Method for Multiple Resource-Constrained in PERT/CPM Network[J]. Systems Engineering —Theory & Practice, 1995, 15(7): 42-47. DOI: 10.12011/1000-6788(1995)7-42 |
| |
| Authors: | Bai Sijun |
| |
| Affiliation: | Management School,Northwestern Polytechnical University, 710072 |
| |
| Abstract: | After discussed problems in resources leveling with fixed project duration,a normalization heuristic resouces leveling method is de-veloped.According to the relative weights that are based on the relative importance of resources in a project,a multi-resource leveling problem can be changed into a one-resource leveling problem,Then problems of limited resources allocation are studied and a heuristic priority coefficient method for resources allocation is given accordingly.It is proved by examples that this method is better than those heuristic methods commouly used nowa-days.Because this method grasps the characteristics of logic and resource constraints of project scheduling. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
