A new approach to solve hybrid flow shop scheduling problems by artificial immune system

被引:204
作者
Engin, O [1 ]
Döyen, A [1 ]
机构
[1] Selcuk Univ, Dept Ind Engn, TR-42250 Konya, Turkey
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2004年 / 20卷 / 06期
关键词
hybrid flow shop scheduling; artificial immune systems; clonal selection; experimental design;
D O I
10.1016/j.future.2004.03.014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Artificial immune system (AIS) is an intelligent problem-solving technique that has been used in scheduling problems for about 10 years. AIS are computational systems inspired by theoretical immunology, observed immune functions, principles and mechanisms in order to solve problems. In this research, a computational method based on clonal selection principle and affinity maturation mechanism of the immune response is used. The n-job, k-stage hybrid flow shop problem is one of the general production scheduling problems. Hybrid flow shop (HFS) problems are NP-Hard when the objective is to minimize the makespan [Two-stage hybrid flowshop scheduling problem, Oper. Res. Soc. 39 (1988) 359]. The research deals with the criterion of makespan minimization for the HFS scheduling problems. The operating parameters of meta-heuristics have an important role on the quality of the solution. In this paper we present a generic systematic procedure which is based on a multi-step experimental design approach for determining the optimum system parameters of AIS. AIS algorithm is tested with benchmark problems. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving HFS problems. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:1083 / 1095
页数:13
相关论文
共 38 条
[1]  
ADA GL, 1987, SCI AM, V2, P50
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
[Anonymous], 1999, 0199 TRDCA
[4]  
Arthanary T., 1971, Opsearch J. Oper. Res. Soc. India, V8, P10
[5]   Heuristics for scheduling in a flow shop with multiple processors [J].
Brah, SA ;
Loo, LL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (01) :113-122
[6]   BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS [J].
BRAH, SA ;
HUNSUCKER, JL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (01) :88-99
[7]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[8]   An exact method for solving the multi-processor flow-shop [J].
Carlier, J ;
Néron, E .
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2000, 34 (01) :1-25
[9]  
COSTA AM, 2002, P SPEC SESS ART IMM, P115
[10]  
DASGUPTA D, 1996, P ISCA 96 REN NEV JU