中文说明：
流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码。
English Description：
Pipeline job shop scheduling problem can be described as follows: n tasks are processed in M stages on the pipeline, each stage has at least one machine and at least one stage has multiple machines, and the processing performance of each machine in the same stage is the same, each task in each stage has to complete an operation, and each operation of each task can be completed in the corresponding stage In order to minimize the makespan, it is necessary to determine the order of all tasks and the allocation of machines in each stage when the processing time of each process is known on any machine. The following source code is the general matlab source code of genetic algorithm for solving pipeline job shop scheduling problem.