A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Thumbnail
Tarih
2011
Yazar
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Chen, A.H.L.
Üst veri
Tüm öğe kaydını göster
Özet
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. This paper presents a discrete
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-79957526144&doi=10.1016%2fj.ins.2011.04.018&partnerID=40&md5=88bd48159bcb0b8bd89836053b3e14f1
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10617
Koleksiyonlar