A Heuristic Algorithm for Flowshop Scheduling Problem
Flow Shop Scheduling Problem is a class of scheduling problems with a work shop in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of machines in compliance with given processing orders.In this paper,we propose a new heuristic algorithm based on the analysis and research of which problem,the new method introducing a evaluate mechanism of the relative position of any two jobs to the completion time,and the efficiency and performance has been improved.The result of simulation experiments shows that,our new heuristic algorithm has good performance,and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.
Heuristic Algorithm Flow Shop Production Scheduling NEH
Dan Tang Hong Ping Shu
Chengdu University of Information Technology,Chengdu 610225,P.R.China
国际会议
广州
英文
626-630
2012-11-16（万方平台首次上网日期，不代表论文的发表时间）