A GREEDY ALGORITHM FOR MULTIOBJECTIVE FUZZY FLOW-SHOP SCHEDULING PROBLEM
Küçük Resim Yok
Tarih
2012
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
WORLD SCIENTIFIC PUBL CO PTE LTD
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this paper, a new greedy algorithm is proposed to solve the fuzzy multiobjective flow shop scheduling problem. We use the two approaches; the possibility measure and the area of intersection for multi objective fuzzy flow shop scheduling problem. The proposed new greedy algorithm is tested on the benchmark problems in the literature. The performance parameters of proposed greedy algorithm are determined by full factorial design of experiments (DOE). The performance of the proposed greedy algorithm is compared with the scatter search method.
Açıklama
10th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science (FLINS) -- AUG 26-29, 2012 -- Istanbul, TURKEY
Anahtar Kelimeler
Kaynak
UNCERTAINTY MODELING IN KNOWLEDGE ENGINEERING AND DECISION MAKING
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
7
