Loading...

An efficient algorithm for solving bi-objective fuzzy job-shop scheduling problems by genetic algorithms and data mining

Rabbani, M ; Sharif University of Technology | 2004

95 Viewed
  1. Type of Document: Article
  2. Publisher: 2004
  3. Abstract:
  4. This paper presents a meta-heuristic algorithm for solving bi-objective fuzzy job shop scheduling problems. These objectives are to minimize the makespan and minimize the early and late penalty. Processing time and due date are considered as fuzzy triangular numbers. This paper also introduces a novel use of data mining algorithm for solving of combinatorial optimization problems. The proposed algorithm combines genetic algorithms and an attribute-oriented induction algorithm, which is much quicker than previous methods providing the optimal solution. By considering the structure of proposed algorithm, the whole feasible solutions of a special job shop-scheduling problem are considered as a database. Attribute-oriented induction algorithm must find similar relationships and latent patterns among this database. This algorithm helps genetic algorithms to find the optimal or near-optimal solution much quicker than previous methods. Due to genetic inheritance in solutions obtained by genetic algorithms, the next generation has more similar relationships between their characteristics, operations and sequences. In this paper, three test problems are conducted in order to compare with other solutions reported in the literature and to show the efficiency of the proposed algorithm
  5. Keywords:
  6. Data mining ; Fuzzy jobshop sheduling ; Genetic algorithms ; Jobshop problem
  7. Source: Amirkabir (Journal of Science and Technology) ; Volume 15, Issue 58 D , 2004 , Pages 570-591 ; 10150951 (ISSN)