%0 Journal Article
%T Heuristic Algorithms for Flow Shop Scheduling Problem<br>一种新的求解Flow Shop问题的启发式算法
%A WEI You-shuang
%A YANG Xiang-long
%A FENG Yun-cheng
%A <br>韦有双
%A 杨湘龙
%A 冯允成
%J 系统工程理论与实践
%D 2000
%I 
%X 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.
%K scheduling
%K sequencing
%K flow shop scheduling problem
%K makespan<br>排序
%K 最优化算法
%K 仿真
%K 加工车间的作业排序
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=800EB670BC68F50F&yid=9806D0D4EAA9BED3&vid=A04140E723CB732E&iid=9CF7A0430CBB2DFD&sid=2001E0D53B7B80EC&eid=F4B561950EE1D31A&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=7&reference_num=0