An analogue genetic algorithm for solving job shop scheduling problems

被引:15
作者
Al-Hakim, L [1 ]
机构
[1] Swinburne Univ Technol, IRIS, Hawthorn, Vic 3122, Australia
关键词
D O I
10.1080/00207540010023538
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper develops a genetic algorithm for solving job shop scheduling problems. It discusses the difficulties arising from the traditional encoding of the problem and suggests a new encoding scheme. The paper also develops an analogue electrical system to represent the problem and uses the measure of that system to develop a new measure for the fitness function of the genetic algorithm. The algorithm considers the conventional genetic operations but with some modification. The computational results, developed for the makespan criterion, show that, for this criterion, the algorithm is reliable and performs relatively well.
引用
收藏
页码:1537 / 1548
页数:12
相关论文
共 25 条
[1]  
Aarts E. H., 1994, ORSA Journal on Computing, V6, P118, DOI 10.1287/ijoc.6.2.118
[2]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[3]  
ALHAKIM L, 1990, P 1990 AS PAC MAN C, P82
[4]  
[Anonymous], 1997, LOCAL SEARCH COMBINA
[5]  
[Anonymous], PRACTICAL HDB GENETI
[6]  
BIERWIRTH C, 1995, OR SPEKTRUM, V17, P87, DOI 10.1007/BF01719250
[7]   Production Scheduling and Rescheduling with Genetic Algorithms [J].
Bierwirth, Christian ;
Mattfeld, Dirk C. .
EVOLUTIONARY COMPUTATION, 1999, 7 (01) :1-17
[8]   The job shop scheduling problem: Conventional and new solution techniques [J].
Blazewicz, J ;
Domschke, W ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (01) :1-33
[9]   A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM [J].
BRUCKER, P ;
JURISCH, B ;
SIEVERS, B .
DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :107-127
[10]  
Bruker P., 1995, SCHEDULING ALGORITHM