A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
MetadataShow full item record
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value (LPV) rule is proposed to convert co
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..