说明：  流水线车间生产调度的遗传算法MATLAB源代码 n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小
(Line workshop production scheduling genetic algorithm MATLAB source code n task m phase of the process on the assembly line, each phase and at least one machine exist multiple machines at least one stage, and all the same, the processing performance of the machine on the same phase in each stage of the task to complete the procedure, the task of every working procedure can be found in the corresponding stage of any one machine processing, known task processing time of each working procedure request sort of all the tasks and each stage of the distribution of the machine, making scheduling index minimum Makespan (o))