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

Chinese  Old version

By    In    Search 

  HomeContents of Chinese Journal of Mechanical Engineering (English Edition),2005 No.4EFFICIENT  MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING

Lei Deming

 

Wu Zhiming

Institute of Automation,

Shanghai Jiaotong University,

Shanghai 200030, China

 

 

EFFICIENT MULTI-OBJECTIVE EVOLU-

TIONARY ALGORITHM FOR JOB

SHOP SCHEDULING*

 

Abstract: A new representation method is first presented based on priority rules. According to this method, each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm, the conflict occurring in the corresponding machine is resolved by the corresponding priority rule. Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed, in which both archive maintenance and fitness assignment use crowding measure. Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.

Key words: Job shop  Crowding measure  Archive maintenance  Fitness assignment  Multi-objective evolutionary algorithm

 


* This project is supported by National Natural Science Foundation of China (No.60574049, No.70071017). Received November 17, 2004; received in revised form May 27, 2005; accepted July 14, 2005

 

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