A variable block insertion heuristic for permutation flowshops with makespan criterion
MetadataShow full item record
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size being equal to one. It removes a
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..