An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
Abstract
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. We developed the constructive heu
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..