Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops

Kellegoz T., TOKLU B., Wilson J.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.58, sa.2, ss.300-306, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 58 Sayı: 2
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.cie.2009.11.001
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.300-306
  • Gazi Üniversitesi Adresli: Evet

Özet

In this research, a detailed study of the permutation flowshop scheduling problem with the objective of minimizing total tardiness is presented and a steady-state genetic algorithm solution procedure is developed for such problems. Also, using problem-specific knowledge, a very efficient elite guided solution improvement scheme and an appropriate crossover operator have been developed and integrated into the proposed method. Using benchmark problems, the algorithm has been compared with heuristic algorithms having the best performance in the literature. The performance of the developed algorithm is shown to be superior using a simulation study. (C) 2009 Elsevier Ltd. All rights reserved.