• CN: 11-2187/TH
  • ISSN: 0577-6686

›› 2007, Vol. 43 ›› Issue (4): 119-124.

• Article • Previous Articles     Next Articles

BILEVEL GENETIC ALGORITHM FOR THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM

ZHANG Chaoyong;RAO Yunqing;LI Peigen;SHAO Xinyu   

  1. School of Mechanical Science and Engineering, Huaz-hong University of Science & Technology
  • Published:2007-04-15

Abstract: The multi-objective optimization of the flexible job-shop scheduling problem (FJSP) is studied. According to the charac-teristics of the FJSP, two effective crossover operators and mutation operators are designed for the genetic algorithm. In order to preserve the good characteristics of the previous generation and reduce the disruptive effects of genetic operators, a multistage-based generation alteration model of genetic algo-rithm is proposed to solve the FJSP. The approach is tested on two instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

Key words: Crossover operator, Flexible job-shop scheduling, Genetic algorithm, Mutation operator

CLC Number: