双代号网络计划技术的数字叠加法及其收敛条件的研究

Study on different resources numbers piling up method and astrictive conditions in twin-code name network technique

将多种资源 (人工、材料、机械 )的数量同时在神经网络计划技术上实行数字化叠加 ,从而获得多资源叠加的合成分布 ,再利用神经网络计划技术中各个工作的不同时差和资源数量 ,按收敛条件选择最佳开工工作和开工时间 ,满足多种资源在优化模式中按收敛条件进行最优分布 .

Based on a numbers piled up for varies resources(labor,materials,mechines)in neuron plan,a composed distribution for various resources was obtained.Then,using time difference and quantities of materials,the best selected work and time started as astrictive conditions,the best optimum distribution which satisfied variou resources in difference optimodel and astrictive conditions was got.