A variable block insertion heuristic for permutation flowshops with makespan criterion
Özet
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
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027862282&doi=10.1109%2fCEC.2017.7969382&partnerID=40&md5=eee52e494115a6c18fe98bfd83b63b60https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10069
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
