GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS BASED ON 2 REPRESENTATIONAL SCHEMES

被引：9

作者：

PARK, LJ

PARK, CH

机构：

[1] Department of Electrical Engineering, Korea Advanced Institute of Science and Technolgy, Taejon 305-701, 373-1 Kusong-dong, Yusong-gu

来源：

ELECTRONICS LETTERS | 1995年 / 31卷 / 23期

关键词：

GENETIC ALGORITHMS; SCHEDULING;

D O I：

10.1049/el:19951385

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The Letter explains the application of a genetic algorithm (GA) to job shop scheduling problems with a new crossover and two kinds of mutation based on two representational schemes. Simulation results show that our genetic operators and representational schemes are very powerful and suitable to job shop scheduling problems.

引用

页码：2051 / 2053

页数：3