Apply Inversion Order Number Genetic Algorithm to the Job Shop Scheduling Problem

Through analyzing the present genetic operators to solve the job shop scheduling problem, a inversion order number genetic algorithm is proposed. In view of the quality of the inversion order number, this algorithm measures the population diversity by the relative inversion order number. It uses the information provided by the inversion order number of the individual and the offspring is generated. This algorithm not only satisfies the characteristic of the job shop scheduling problem, but also develops the search capacity of genetic algorithm. The computation results validate the effectiveness of the proposed algorithm.