ON SOLVING FLOWSHOP SCHEDULING PROBLEMS

This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic feature is added. The numerical results show the good position of the proposed algorithms within the top known as best heuristic algorithms in the field.

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

[2]  Anurag Agarwal,et al.  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..

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

[4]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[5]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[6]  Uday Kumar Chakraborty,et al.  An improved heuristic for permutation flowshop scheduling , 2007, Int. J. Inf. Commun. Technol..

[7]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[8]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[9]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[10]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[11]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[12]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[13]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[14]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

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

[16]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[17]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[18]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

[19]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

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

[21]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[22]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[23]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[24]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[25]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[26]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .