Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization
Tursel Eliiyi, D.
Üst veriTüm öğe kaydını göster
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
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..