An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
Özet
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
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922573105&doi=10.1109%2fCIPLS.2014.7007156&partnerID=40&md5=0f07fa585c2efe2b8ed0b48b64549d7ehttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10406
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..