A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
Abstract
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to the
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85066617863&doi=10.3390%2fa12050100&partnerID=40&md5=a6c8c46fdb639068c728755b9b691b93https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9834
Collections

DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..