说明：  流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。
(Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.)