Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops
Yükleniyor...
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Pergamon-Elsevier Science Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
Anahtar Kelimeler
Flowshop scheduling, Steady-state genetic algorithms, Total tardiness, Crossover operator, Improvement scheme
Kaynak
Computers & Industrial Engineering
WoS Q Değeri
Q2
Scopus Q Değeri
Q1
Cilt
58
Sayı
2
Künye
closedAccess
