An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria

In this paper, we propose an iterated greedy algorithm for solving the blocking Dow shop scheduling problem with total Dow time minimization objective. The steps of thisalgorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic bymodifying the best known NEH algorithm. Effectiveness of theproposed iterated greedy algorithm is tested on the Taillard's instances. Computational results show the high efficiency of thisalgorithm with comparison state-of-the-art algorithms. We report new best solutions for 88 instances of 120 Taillard's instances.

کلیدواژه ها:

Constructive heuristic ، Iterated greedy algorithm ، Blocking flow shop ، Total flow time