NEH-Based heuristics for the distributed blocking flowshop with makespan criterion
MetadataShow full item record
The distributed blocking flowshop scheduling problem (DBFSP) that is an important generalization of the traditional blocking flowshop scheduling problem (BFSP), in which the blocking constraint has to be considered. The NEH heuristic is regarded as the be
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..