A new hybrid heuristic algorithm for solving flowshop-scheduling problem

This paper presents a new heuristic hybrid algorithm for solving flow shop-scheduling problem. The algorithm is based on a general optimization method, which works in two stages. In the first stage it performs a global search of the optimal solution by a Monte Carlo based approach, while in the second stage of the local search, the previous solution is improved. To prove the effectiveness of the proposed method, numerous computational tests as well as a statistical analysis are presented.peer-reviewe