Heuristic Algorithms for Flow Shop Scheduling Problem
一种新的求解Flow Shop问题的启发式算法

Flow shop scheduling problem is a well\|known NP\|hard problem. In this paper we first summarize the exist heuristic algorithms for flow shop problem which the objective is minimize makespan and then on the basis of NEH algorithm, we propose a new heuristic algorithm for flow shop to minimize the makespan. The numerical experiments show that the proposed algorithm has very good performance.