流水调度的数组简单算法。n个作业要在由俩台机器M1和M2组成的流水线上完成加工。每个作业的顺序都是现在M1上加工，然后在M2上加工。这个问题要求确定这n个作业的最优加工顺序，使得从第一个作业M1上开始加工，到最后一个作业在机器M2上加工完成所需的时间最短-Array of simple flow scheduling algorithm. n a job in the two machines M1 and M2 components of the pipeline to complete processing. Each job order is now processed on M1, then M2 on the processing. This problem requires to determine the optimal n-job processing order, making M1 from the first job to begin processing, to the last job on machine M2 shortest processing time required to complete