Flow-shop网络作业计划模型的解法

摘要

将Flow-Shop网络作业计划的优化模型Sch(m,n)Lp［1］化为向量矩阵线性空间，利用线性空间的理论提出了一个求解Flow-Shop网络最优作业计划模型的有效解法.%It gives a defintion of two-vector matrix space,and using linear algebra theory,puts forward an improved optimization pattern based on the optimization pattern Sch(m,n)Lp of the flow-shop system schedules established in this paper.