Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization
Özet
1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, and most consider makespan as the o
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050630493&doi=10.1145%2f3205455.3205500&partnerID=40&md5=0a6be08edc1f62f5d045261dc7a88e86https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9961
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
