Optimizing the Permutation Flowshop Scheduling Problem by Scatter Search
Küçük Resim Yok
Tarih
2016
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ege Univ, Fac Economics & Admin Sciences
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Scheduling is one of the decision-making processes that play a critical role in the production and service industries. Flow job scheduling is one of the types of scheduling where "n" job can be processed at "m" machines consequently. When the complexity of this problem increases, obtaining the optimum solution becomes difficult. But, solution can be found near the optimum in these complex problems by using the scatter search which is one of the meta heuristics. Scatter search method which is a branch of the evolutionary approach is an advantageous optimization technique due to producing two or more solution. In this study, the new model is developed for optimizing the permutation flowshop scheduling problem by scatter search.
Açıklama
Anahtar Kelimeler
Scheduling, Permutation Flow Job Scheduling, Scatter Search
Kaynak
Ege Academic Review
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
16
