A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Oner, A.
Metadata
Show full item record
Abstract
In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flows
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84878203450&doi=10.1016%2fj.apm.2013.02.011&partnerID=40&md5=d8eb430efdfdda70d99731834758fdcb
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10505
Collections