An Iterated Greedy Algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization
MetadataShow full item record
In this paper, we study a distributed blocking flowshop scheduling problem (DBFSP) that is an extension of the traditional blocking flowshop scheduling problem (BFSP), in which an additional decision of which factory to process each job. We propose an ite
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..