Loading...

A memetic algorithm for flexible flow shop sequence dependent group scheduling problem

Keshavarz, T. Y ; Sharif University of Technology | 2010

566 Viewed
  1. Type of Document: Article
  2. Publisher: Institute of Industrial Engineers , 2010
  3. Abstract:
  4. The focus of this research is on the flexible flow shop sequence dependent group scheduling problem (FFSDGS) with minimization of makespan as the criterion (FFm|fmls, Splk|Cmax). Since the research problem is shown to be NP-hard, a meta-heuristic algorithms based on memetic algorithm is developed to efficiently solve the problem. The performance of the proposed algorithm is compared with the only available meta-heuristic algorithm in the literature, i.e., tabu search (TS). The comparison is performed based on paired t-test and the result shows that the memetic algorithm has a superior performance compared to the TS
  5. Keywords:
  6. Memetic algorithm ; Sequence dependent group scheduling ; Heuristic algorithms ; Machine shop practice ; Scheduling algorithms ; Tabu search ; Flexible flow shop ; Group scheduling ; Makespan ; Memetic algorithms ; Meta heuristic algorithm ; Meta heuristics ; Research problems ; Sequence-dependent ; Problem solving
  7. Source: IIE Annual Conference and Expo 2010 Proceedings, 5 June 2010 through 9 June 2010 ; 2010
  8. URL: https://www.highbeam.com/doc/1P3-2093697161.html