%0 Journal Article
%T Network Planning Method with Imprecise Activity Durations<br>具有不精确活动周期的网络计划方法
%A ZHANG Hong-Guo
%A XU Xiao-Fei
%A ZHAN De-Chen
%A <br>张宏国
%A 徐晓飞
%A 战德臣
%J 自动化学报
%D 2008
%I 
%X The problems of computing the time parameters and evaluating criticality of activities in networks with impre- cise activity durations are very difficult and have never been solved in a fully satisfactory manner in the past.So,the new polynomial algorithms for determining the intervals of the time parameters in general networks are proposed,and the criticality of activities can be evaluated by their floats.Finally,a solvable case is present,and then the results are extended to networks with fuzzy activity durations.
%K Project plan
%K network planning method
%K imprecise activity duration
%K critical activity
%K critical path<br>项目计划
%K 网络计划方法
%K 不精确活动周期
%K 关键活动
%K 关键路径
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=1AC47E4CB056E4C84DCFD33C1368068B&yid=67289AFF6305E306&vid=339D79302DF62549&iid=9CF7A0430CBB2DFD&sid=6EEBEF38C7DFC97E&eid=01A9864A3FFB986F&journal_id=0254-4156&journal_name=自动化学报&referenced_num=0&reference_num=12