Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach

被引:25
|
作者
Zare, H. Khademi [1 ]
Fakhrzad, M. B. [1 ]
机构
[1] Yazd Univ, Dept Ind Engn, Yazd, Iran
关键词
Flexible flow-shop scheduling; Genetic algorithm; Data mining; Attribute-driven deduction; Fuzzy sets; SCHEDULING PROBLEM; SHOP; 2-STAGE; TIME; HEURISTICS;
D O I
10.1016/j.eswa.2010.12.101
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, an efficient algorithm is presented to solve flexible flow-shop problems using fuzzy approach. The goal is to minimize the total job tardiness. We assume parallel machines with different operation times. In this algorithm, parameters like "due date" and "operation time" follow a triangular fuzzy number. We used data mining technique as a facilitator to help in finding a better solution in such combined optimization problems. Therefore, using a combination of genetic algorithm and an attribute-deductive tool such as data mining, a near optimal solution can be achieved. According to the structure of the presented algorithm, all of the feasible solutions for the flexible flow-shop problem are considered as a database. Via data mining and attribute-driven deduction algorithm, hidden relationships among reserved solutions in the database are extracted. Then, genetic algorithm can use them to seek an optimum solution. Since there are inherited properties in the solutions provided by genetic algorithm, future generation should have the same behavioral models more than preliminary ones. Data mining can significantly improve the performance of the genetic algorithm through analysis of near-optimal scheduling programs and exploration of hidden relationships among pre-reached solutions. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:7609 / 7615
页数:7
相关论文
共 50 条
  • [21] A genetic algorithm approach for solving a flexible job shop scheduling problem
    Department of Industrial Engineering, Faculty of Mechanical Engineering, 81310 Skudai, Johor Bahru, Malaysia
    Int. J. Comput. Sci. Issues, 1600, 3 (85-90):
  • [22] Adaptive Genetic Algorithm for Hybrid Flow-shop Scheduling
    Zhu, Xiao Chun
    Zhao, Jian Feng
    Wang, Mu Lan
    MATERIALS PROCESSING AND MANUFACTURING III, PTS 1-4, 2013, 753-755 : 2925 - +
  • [24] A GREEDY ALGORITHM FOR MULTIOBJECTIVE FUZZY FLOW-SHOP SCHEDULING PROBLEM
    Engin, Orhan
    Yilmaz, M. Kerim
    Akkoyunlu, M. Cabir
    Baysal, M. Emin
    Sarucan, Ahmet
    UNCERTAINTY MODELING IN KNOWLEDGE ENGINEERING AND DECISION MAKING, 2012, 7 : 189 - 194
  • [25] A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem
    Wang, L. (wangling@tsinghua.edu.cn), 1600, South China University of Technology (31):
  • [26] Estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machine
    Wang, Sheng-Yao
    Wang, Ling
    Xu, Ye
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2013, 19 (06): : 1304 - 1312
  • [27] An Estimation of Distribution Algorithm for Solving Hybrid Flow-shop Scheduling Problem with Stochastic Processing Time
    Wang Shengyao
    Wang Ling
    Xu Ye
    2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, : 2456 - 2461
  • [28] An improved algorithm for a hybrid flow-shop problem in graphics processing
    Jiang Y.-W.
    Wei Q.
    Zidonghua Xuebao/Acta Automatica Sinica, 2011, 37 (11): : 1381 - 1386
  • [29] Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
    Oguz, C
    Fung, YF
    Ercan, MF
    Qi, XT
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 987 - 997
  • [30] Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
    Oguz, C
    Fung, YF
    Ercan, MF
    Qi, XT
    COMPUTATIONAL SICENCE - ICCS 2003, PT III, PROCEEDINGS, 2003, 2659 : 548 - 559