模糊计划网络最关键路的求取算法

An algorithm for selection of the most critical path in a project network

讨论在给定限制期情况下 ,边的长度 (活动时间 )为对称三角模糊数的计划网络最关键路 (MCP)的求解问题 .该问题本质上是一个复杂的比例路径问题 ,尽管许多其它类似的比例路径问题已被证明为 NP问题 ,但是我们能够把该问题的求解转化为最长路的变权迭代 ,并给出相应的精确求解算法 .同时 ,利用模糊推理 ,可以实现对计划按期完工可能性的估计 .

This paper studies the ‘most critical path’problem(MCP) in a fuzzy project network by a given deadline, while the duration(arc length) is symmetric triangular fuzzy number(STFN). In fact, this kind of problem can be regarded as the minimum ratio path problem, which is known to be a strong NP problem. However, an algorithm is proposed to solve the problem by converting it to a series of longest path problems. Further, the probability of the project being completed within the deadline could be estimated by using fuzzy inference.