Heuristic algorithms for the flowshop scheduling problem

The flowshop scheduling problem is a well-known NP-hard problem. In this paper we first summarize the existing heuristic algorithms for flowshop problem in which the objective is to minimize makespan and then on the basis of one of these algorithms, we propose a new heuristic algorithm for flowshop to minimize the makespan. The numerical experiments show that the proposed algorithm has very good performance.