A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm

被引:45
作者
Cheng, Bor-Wen
Chang, Chun-Lang
机构
[1] Natl Formosa Univ, Dept Ind Management, Yunlin 632, Taiwan
[2] Natl Yunlin Univ Sci & Technol, Dept Ind Engn & Management, Yunlin 640, Taiwan
关键词
genetic algorithm; Taguchi experimental design; flowshop scheduling;
D O I
10.1016/j.eswa.2005.12.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As genetic algorithm parameters vary depending on different problem types when applying genetic algorithm to reach global optimum, appropriate design value selection has significant impact on the efficiency of genetic algorithm. However, most users adjust parameters manually based on the reference values of previous literature. Such trial-and-error method is time-consuming, ineffective, and often it could not locate the optimal combination. Therefore, in flowshop scheduling problems, this research anticipates to complete optimal parameter combination design in genetic algorithm using Taguchi experimental design. According to the research results, different ways of producing initial solution have significant influence on this research topic. Consequently, confirmation experiment is conducted using the optimal parameter combination obtained from the research results. It is found that the predicted value of signal-to-noise ratio (S/N ratio) and its actual value exists deviation of 0.238%, indicating repetitiveness and robustness of the obtained parameter combination. Hence, this research method can effectively reduce time spent on parameter design using genetic algorithm and increase efficiency of algorithm. (C) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:415 / 421
页数:7
相关论文
共 12 条
[1]   Minimizing makespan in a blocking flowshop using genetic algorithms [J].
Caraffa, V ;
Ianes, S ;
Bagchi, TP ;
Sriskandarajah, C .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 70 (02) :101-115
[2]  
Corman T., 1990, INTRO ALGORITHMS
[3]  
Douglas CM., 2001, DESIGN ANAL EXPERIEM
[4]  
Goldberg D.E, 1989, GENETIC ALGORITHMS S
[5]   OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS [J].
GREFENSTETTE, JJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01) :122-128
[6]   Improved genetic algorithm for the permutation flowshop scheduling problem [J].
Iyer, SK ;
Saxena, B .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) :593-606
[7]  
Michalewicz Z., 1996, GENETIC ALGORITHMS D
[8]   Genetic algorithms for flowshop scheduling problems [J].
Murata, T ;
Ishibuchi, H ;
Tanaka, H .
COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 30 (04) :1061-1071
[9]   A HEURISTIC ALGORITHM FOR THE M-MACHINE, N-JOB FLOWSHOP SEQUENCING PROBLEM [J].
NAWAZ, M ;
ENSCORE, EE ;
HAM, I .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (01) :91-95
[10]  
Rinnooy Kan AHG, 1976, Machine scheduling problems: classification, complexity and computations