计算最短时间序列.txt

炼钢浇注的时序规划算法

  
for   i   =   1:Num_csp_jc
    for   j  =  1:Num_csp
        Arrive_csp((i-1)*Num_csp+j+1)   =   Arrive_csp((i-1)*Num_csp+j) ...
            +  T_csp_jc1*(i==1)  +  T_csp_jc2*(i==2) + T_interval_csp12*(i>=2);
    end
end                                                     %  到达CSP连铸机钢水的最晚时间序列

Arrive_zhhb      =      zeros(1,Num_zhhb);
Arrive_zhhb(1)   =      T_arrive_zhhb_last;
for   i   =   1:Num_zhhb_jc
    Arrive_zhhb((i-1)*Num_zhhb+1) = (i>=2)*Arrive_zhhb((i-1)*Num_zhhb) +    T_interval_zhhb12*(i==2) + T_interval_zhhb23*(i == 3)
    for  j   =   2:Num_zhhb   
        Arrive_zhhb((i-1)*Num_zhhb+j)   =    Arrive_zhhb((i-1)*Num_zhhb+j-1)...
            +  T_zhhb_jc1*(i==1)  +  T_zhhb_jc2*(i==2)+  T_zhhb_jc3*(i==3) +    T_interval_zhhb12*(i>=2) + T_interval_zhhb23*(i >= 3)  ;
    end
end