A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
Özet
In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum block size. After constructing th
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84999700001&doi=10.3390%2fa9040071&partnerID=40&md5=56e0fcaad5114127678fa4ae85f20250https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10229
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..