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 条
  • [1] Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm
    Chen, Jen Shiang
    Pan, Jason Chao Hsien
    Lin, Chien Min
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2009, 16 (01): : 23 - 31
  • [2] Improved greedy genetic algorithm for solving the hybrid flow-shop scheduling problem
    Song C.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2019, 41 (05): : 1079 - 1086
  • [3] A hybrid genetic algorithm for the flow-shop scheduling problem
    Tseng, Lin-Yu
    Lin, Ya-Tai
    ADVANCES IN APPLIED ARTICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 218 - 227
  • [4] A Distributed Approach to Solving Hybrid Flow-shop Scheduling Problem
    Zou Feng-xing
    Zeng Ling-li
    Gao Zheng
    Liu Feng
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 2457 - 2461
  • [5] Hybrid Flow-Shop Scheduling Problem Based on Genetic Algorithm
    Rong, Zhang
    PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017), 2017, 123 : 1703 - 1706
  • [6] A heuristic algorithm for solving hybrid flow-shop master scheduling problem
    Chen Zhumin
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE OF MANAGEMENT SCIENCE AND INFORMATION SYSTEM, VOLS 1-4, 2009, : 247 - 251
  • [7] Scheduling for Flexible Flow-Shop Problem Based on an Improved Genetic Algorithm
    Wang, Xudong
    Dai, Qingyun
    2014 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - CHINA, 2014,
  • [8] Using genetic algorithm to solve fuzzy flow-shop scheduling problem
    Geng, Zhao-Qiang
    Zou, Yi-Ren
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2002, 24 (06):
  • [9] Solving flow-shop scheduling problem by hybrid particle swarm optimization algorithm
    Gao Shang
    Yang Jing-yu
    Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 1006 - +
  • [10] EDA algorithm with correlated variables for solving hybrid flow-shop scheduling problem
    Liu, Chang
    Li, Dong
    Peng, Hui
    Shi, Hai-Bo
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2015, 21 (04): : 1032 - 1039