A bicriteria m-machine flowshop scheduling with sequence-dependent setup times
Yükleniyor...
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science Inc
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this study, a bicriteria m-machine flowshop scheduling with sequence-dependent setup times is considered. The objective function of the problem is minimization of the weighted sum of total completion time and makespan. Only small size problems with up to 6 machines and 18 jobs can be solved by the proposed integer programming model. Also the model is tested on an example. We also proposed three heuristic approaches for solving large jobs problems. To solve the large sizes problems up to 100 jobs and 10 machines, special heuristics methods is used. Results of computational tests show that the proposed model is effective in solving problems. (c) 2009 Elsevier Inc. All rights reserved.
Açıklama
Anahtar Kelimeler
m-Machine flowshop scheduling, Bicriteria, Sequence-dependent setup times, Integer programming model, Heuristic methods
Kaynak
Applied Mathematical Modelling
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
34
Sayı
2
Künye
closedAccess
