Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

Abstract

Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling problem (BFSP) with the makespan cri