航空学报 > 1994, Vol. 15 Issue (7): 891-894

活动网络计划约束的复杂性度量及其应用

白思俊   

  1. 西北工业大学管理学院,西安,710072
  • 收稿日期:1992-10-08 修回日期:1993-09-22 出版日期:1994-07-25 发布日期:1994-07-25

COMPLEXITY MEASURES OF RESTRICTIVENESS OF ACTIVITY NETWORKS AND ITS APPLICATIONS

Bai Sijun   

  1. School of Management,Northwestern Polytechnical University, Xi′an,7 10072
  • Received:1992-10-08 Revised:1993-09-22 Online:1994-07-25 Published:1994-07-25

摘要: 根据反映活动网络计划约束特征的节点的紧前紧后活动数,提出了一个衡量活动网络计划约束的复杂系数──网络复杂性系数(CNC),并结合有资源约束的网络计划问题提出了一个衡量该类问题的复杂性系数──资源约束的网络复杂性系数(CRNC),最后介绍了网络复杂性系数在随机活动网络发生器算法设计中的应用,给出了一个产生给定复杂系数的随机活动网络的随机活动网络发生器的设计算法。

关键词: 活化-网络计划, 度量-约束, 网络-复杂性

Abstract: Based On the number of predecessors and successors of node in activity networks,a kind of coefficient──Coefficient of Network Complexity (CNC)──to measure the com-plexity of networks is proposed. A coefficient──Coefficient of Resource-constrained Networks Complexity(CRNC)──to measure the complexity of resource-constrained networks is pro-vided, Finally,applications of CNC for the designing of GRAN are introduced,and an algorithm to generate random activity networks with a given complexity is presented.

Key words: activation-network analysis, measures-constrints, networks-complexity

中图分类号: