The tricriteria flowshop scheduling problem
Yükleniyor...
Tarih
2008
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer London Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Multicriteria flowshop scheduling problems have been one of the most attractive subjects in recent years. In the multicriteria flowshop scheduling literature, a very limited number of studies have been performed on problems which include a tardiness criterion. In this paper a multicriteria (tricriteria) two-machine flowshop scheduling problem with a tardiness criterion is tackled. The objective is to minimise a weighted sum of total completion time, total tardiness and makespan. An integer programming model is proposed for the problem which belongs to NP-hard class. The modified NEH (Nawaz, Enscore and Ham) algorithm, a tabu search-based heuristic method, random search and the EDD rule (the earliest due date rule) are used to solve problems with up to 2,500 jobs. A computational analysis is conducted to evaluate the performance of the heuristics. The analysis shows that the heuristics are quite efficient, and the performance of the tabu search based heuristic is the best of all in terms of solution quality.
Açıklama
Anahtar Kelimeler
flowshop scheduling, tricriteria, integer programming, heuristic methods
Kaynak
International Journal Of Advanced Manufacturing Technology
WoS Q Değeri
Q3
Scopus Q Değeri
Q1
Cilt
36
Sayı
11-12
Künye
closedAccess
