Home|News|Literature|Journal|Instruction|Forum|Member|Introduction

Chinese  Old version

By    In    Search 

  HomeContents of Chinese Journal of Mechanical Engineering 2007 No.4BILEVEL GENETIC ALGORITHM FOR THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM

BILEVEL GENETIC ALGORITHM FOR THE

FLEXIBLE JOB-SHOP SCHEDULING PROBLEM

 

ZHANG Chaoyong  RAO Yunqing  LI Peigen  SHAO Xinyu

(School of Mechanical Science and Engineering, Huazhong University of Science & Technology, Wu-han 430074)

 

Abstract: The multi-objective optimization of the flexible job-shop scheduling problem (FJSP) is studied. According to the characteristics 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-ithm 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: Flexible job-shop scheduling Genetic algorithm Crossover operator Mutation operator

CLC No: TP301

国家重点基础研究发展计划(973计划,2005CB724107)和国家自然科学基金(50305008)资助项目. Received 20060627, received in revised form 20061117

 
Open or Download Full Text of this Paper (PDF File)
 
  About us-Contact us-Site map-Advertisement service-Cooperation-Legal statement  

Address: 22 Baiwanzhuang Dajie, Beijing 100037 China    Tel: 8610-88379907    Fax: 8610-68994557

E-mail: cjme@mail.machineinfo.gov.cn  http: //www.cjmenet.com
©2006 Editorial Office of CJME. All Right Reserved