An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion

Thumbnail
Date
2014
Author
Kizilay, D.
Tasgetiren, M.F.
Pan, Q.K.
Wang, L.
Metadata
Show full item record
Abstract
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. We developed the constructive heu
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922573105&doi=10.1109%2fCIPLS.2014.7007156&partnerID=40&md5=0f07fa585c2efe2b8ed0b48b64549d7e
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10406
Collections