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.

[1]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[2]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[3]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[4]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[5]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

[6]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[7]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[8]  Yi Pan,et al.  An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model , 2009, Expert Syst. Appl..

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  Ping Chen,et al.  Study on heuristics for the permutation flowshop with sequence dependent setup times , 2009, 2009 IEEE International Conference on Information Reuse & Integration.

[11]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[12]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .