A Hybrid Genetic Algorithm for Solving a Multi-objective Job Scheduling Problem on Parallel Machines Based JIT Technique
基于JIT的多目标并行多机调度问题的混合遗传算法

A hybrid genetic algorithm is presented for minimizing the range of lateness and make-span on parallel identical machines. Its coding method is very simple because it utilized the properties of optimal effective algorithm of the corresponding single machine problem. Numeric examples illustrate that the genetic algorithm has the properties of fast convergence. The solutions gained by the genetic algorithm are pretty well.