Flow-Shop网络中最大服务效率的作业顺序

Jobs Scheduling Method of the Maximal Operation Efficiency in the Flow-Shop System

讨论了 Flow- shop网络中最大服务效率的作业排序问题 ,给出了机器完成服务时间与作业结束服务时间之和的一个下界估计公式 ,由此提出了一个可使 Flow-

In this paper, we have discussed the problem on the jobs scheduling of maximal operation efficiency in the m×n flow shop, have set up the lower bound of the sum of the completion times of all jobs and the completion times of all machines, and also have given a jobs scheduling method of the maximal operation efficiency in the m×n flow shop and an example.