一、计算事件的最早发生时间ve(k)ve(1)=0ve(k)=max{ve(j)+<vj,vk>上的权}<vj,vk>为所有到达vk的有向边v1v2v4v5v8v10v7v6v3v9a1=3a2=2a3=6a4=3a5=8a6=4a7=2a8=7a9=4a10=6a11=9a12=6a13=5a14=4a15=8vev10v23v32v4v5v6v7v8v9v109131120171725二、计算事件的最迟发生时间vl(k)vl(n)=ve(n)vl(k)=min{vl(j)-<vk,vj>上的权}<vk,vj>为所有从vk出发的有向边vevlv10v23v32v49v513v611v720v817v917v102525172**********v1v2v4v5v8v10v7v6v3v9a1=3a2=2a3=6a4=3a5=8a6=4a7=2a8=7a9=4a10=6a11=9a12=6a13=5a14=4a15=8三、计算活动ai的最早开始时间e[i]若活动ai有边<vj,vk>表示,则活动ai的最早开始时间e[i]可由下式计算:e[i]=ve[j]vev10v23v32v49v513v611v720v817v917v1025a1a2a3a4a5a6a7a8a9a10a11a12a13a14a15ei0032399213131111201717v1v2v4v5v8v10v7v6v3v9a1=3a2=2a3=6a4=3a5=8a6=4a7=2a8=7a9=4a10=6a11=9a12=6a13=5a14=4a15=8四、计算活动ai的最迟开始时间l[i]若活动ai有边<vj,vk>表示,则活动ai的最迟开始时间l[i]可由下式计算:l[i]=vl[k]-<vj,vk>vlv10v23v34v49v514v611v720v821v917v1025a1a2a3a4a5a6a7a8a9a10a11a12a13a14a15li0236610941714111120211
关键路径 来自淘豆网www.taodocs.com转载请标明出处.