考虑复杂搭接关系的灰色网络计划模型

The Grey Network Scheduling Model with Complex Spliced Relations

将复杂搭接关系引入灰色网络计划模型,并对搭接关系组合进行了分析.其中,活动持续时间与搭接时距都为灰数且服从三角白化权函数分布并使用核和灰度形式表示,在时间参数计算中引用基于论域的灰度计算法则以解决核与灰度加减运算结果与原灰区间不符的问题,并改进基于相对核与精确度的灰数排序方法以适应本模型考虑白化权函数的情况,同时将关键路径识别放置在最迟时间参数计算之前以解决逆向递推无法正确计算最迟时间的问题.

In this paper,the complex spliced relations is introduced into the grey network scheduling model,and the combination of spliced relations is analyzed.In the model,both the activity durations and the time lags are grey numbers,which follow the distribution of triangle whiten weight function and are expressed in the form of the kernel and degree of greyness.In the calculation of time parameters,the calculation rule of degree of greyness based on the domain is used to solve the problem that the results of the addition and subtraction operations of the kernel and degree of greyness are inconsistent with the original gray interval,and ranking method of grey numbers based on relative kernel and degree of accuracy is improved to adapt to the case of considering the whitening weight function.The identification of critical path is placed before the calculation of the latest time parameter to solve the problem that the reverse recursion could not calculate the latest time correctly.