Metaheuristic algorithms for the hybrid flowshop scheduling problem
Abstract
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan criterion, studies on HFSP with
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
