用遗传算法解决作业车间调度问题。作业车间调度可描述为集合{J，M，Op，T}(其中:J代表工件，M代表机器，Op代表工序，T代表工件的加工时间)，即如何将工件的工序按照合理的顺序分配到机器上，以达到目标函数的要求。-Using Genetic Algorithm for Job Shop Scheduling Problems. Job shop scheduling can be described as a set {J, M, Op, T} (where: J on behalf of the workpiece, M stands for machine, Op behalf of processes, T on behalf of the workpiece processing time), that is how the parts of the process in accordance with the allocation of a reasonable order to the machine in order to achieve the requirements of the objective function.