完成流水线安排问题的解决，具体问题描述如下：

有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。

解决方案用图形界面画出。-pipeline completed arrangements for the settlement of this problem, the specific issues described as follows : m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine at a fixed time. Once a process started, it can not be interrupted. Each machine can handle only one a process. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specific, the issue is meeting the requirements of (1), (2) 2 binding conditions on the premise that identify each machine processes the order, so that the processing time span (from the beginning of the processing of all parts are needed to complete the processing time) to achieve the smallest. Which, (a) the workpiece constra