说明：  n个任务在流水线上进行m个阶段的加工 ，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机 器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以 在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所 有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最 小。
(n-m on the task in the pipeline processing stages, each stage has at least one machine there and at least one stage of multiple machines and each machine on the same stage of the processing performance of the same, at each stage required to complete each task a process, the task of each process in the corresponding stage of any one of the machine processing, known task processing time for each process, identify all tasks required for each stage of the sorting and distribution of the machine, making the scheduling Index (General requirements Makespan) minimum.)