Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

Thumbnail
Date
2017
Author
Tasgetiren, M.F.
Kizilay, D.
Pan, Q.K.
Suganthan, P.N.
Metadata
Show full item record
Abstract
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling problem (BFSP) with the makespan cri
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982854598&doi=10.1016%2fj.cor.2016.07.002&partnerID=40&md5=6e9d916fe7389f73455fc3b13352db0e
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10143
Collections