Improved heuristically guided genetic algorithm for the flow shop scheduling problem

This paper deals with the problem of scheduling on makespan criterion in the flow shop environment. We have presented a new heuristic genetic algorithm (NGA) that combines the good features of both the genetic algorithms and heuristic search. The NGA is run on a large number of problems and its performance is compared with that of the Standard Genetic Algorithm (SGA) and the well-known Nawaz-Enscore-Ham (NEH) heuristic. The NGA is seen to perform better in almost all instances. The complexity of the NGA is found to be better than that of the SGA. The NGA also performs superior results when compared with the simulated annealing from the literature.

[1]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[2]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[3]  Varghese S. Jacob,et al.  Genetic Algorithms for Product Design , 1996 .

[4]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[5]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

[6]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

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

[8]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[9]  Dirk Van Gucht,et al.  The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Paul Humphreys,et al.  Minimizing the bullwhip effect in a supply chain using genetic algorithms , 2006 .

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

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

[14]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[15]  Andrea T. Staggemeier,et al.  A hybrid genetic algorithm to solve a lot-sizing and scheduling problem , 2002 .

[16]  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..

[17]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[18]  Evelyn C. Brown,et al.  A grouping genetic algorithm for registration area planning , 2006 .

[19]  Kalyanmoy Deb,et al.  Analysis of Selection Algorithms: A Markov Chain Approach , 1996, Evolutionary Computation.

[20]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[21]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

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

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

[25]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[26]  N. A. J. Hastings,et al.  A New Bound for Machine Scheduling , 1976 .

[27]  Uday Kumar Chakraborty,et al.  A Branching Process Model for Genetic Algorithms , 1995, Inf. Process. Lett..

[28]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[29]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .