给定n个作业，每个作业有两道工序，分别在两台机器上处理。一台机器一次只能处理一道工序，并且一道工序一旦开始就必须进行下去直到完成。一个作业只有在机器1上的处理完成以后才能由机器2处理。假设已知作业i在机器j上需要的处理时间为t[i,j]。流水作业调度问题就是要求确定一个作业的处理顺序使得尽快完成这n个作业。-Given n jobs, each job prescribe procedures were handled on both machines. A machine can only handle a process, and a process once started must continue until completion. A job only after processing is completed on the machine 1 2 can be processed by the machine. Assuming the machine is known operating i j required processing time t [i, j]. Flow-shop scheduling problem is required to determine the processing order of a job so complete that n operations as soon as possible.