A hybrid genetic algorithm for the job shop scheduling problems

  • Authors:

  • Byung Joo Park;Hyung Rim Choi;Hyun Soo Kim

  • Affiliations:

  • Department of MIS, Dong-A University 840, Hadan-dong, Saha-gu, Busan 604-714, South Korea;Department of MIS, Dong-A University 840, Hadan-dong, Saha-gu, Busan 604-714, South Korea;Department of MIS, Dong-A University 840, Hadan-dong, Saha-gu, Busan 604-714, South Korea

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.02

Visualization

Abstract

The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetics algorithm to address JSSP. We design a scheduling method based on Single Genetic Algorithm (SGA) and Parallel Genetic Algorithm (PGA). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, the initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling methods based on genetic algorithm are tested on five standard benchmark JSSP. The results are compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement in solution quality. The superior results indicate the successful incorporation of a method to generate initial population into the genetic operators.