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 条
  • [31] A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
    Ceyda Oĝuz
    M. Fikret Ercan
    Journal of Scheduling, 2005, 8 : 323 - 351
  • [32] A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
    Oguz, C
    Ercan, M
    JOURNAL OF SCHEDULING, 2005, 8 (04) : 323 - 351
  • [33] Solving the Flow-Shop Scheduling problem using Grover's Algorithm
    Saiem, Malak
    Arbaoui, Taha
    Hnaien, Faicel
    PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 2250 - 2253
  • [34] Solving permutation flow-shop scheduling problem by rhinoceros search algorithm
    Deb, Suash
    Tian, Zhonghuan
    Fong, Simon
    Tang, Rui
    Wong, Raymond
    Dey, Nilanjan
    SOFT COMPUTING, 2018, 22 (18) : 6025 - 6034
  • [35] Solving permutation flow-shop scheduling problem by rhinoceros search algorithm
    Suash Deb
    Zhonghuan Tian
    Simon Fong
    Rui Tang
    Raymond Wong
    Nilanjan Dey
    Soft Computing, 2018, 22 : 6025 - 6034
  • [36] A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems
    Fazekas, Levente
    Tuu-Szabo, Boldizsar
    Koczy, Laszlo T.
    Hornyak, Oliver
    Nehez, Karoly
    ALGORITHMS, 2023, 16 (09)
  • [37] An Improved DE Algorithm for Solving Hybrid Flow-shop Scheduling Problems
    Zhang Y.
    Tao Y.
    Wang J.
    Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2021, 32 (06): : 714 - 720
  • [38] Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates
    Abd El-Wahed Khalifa, Hamiden
    Alodhaibi, Sultan S.
    Kumar, Pavan
    ADVANCES IN FUZZY SYSTEMS, 2021, 2021
  • [39] Solving a dock assignment problem as a three-stage flexible flow-shop problem
    Berghman, L.
    Leus, R.
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 320 - 324
  • [40] An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines
    Wang, Sheng-yao
    Wang, Ling
    Liu, Min
    Xu, Ye
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 68 (9-12): : 2043 - 2056