An artificial neural network based heuristic for flow shop scheduling problems

The objective of this paper is to find a sequence of jobs in the flow shop to minimize makespan. A feed forward back propagation neural network is used to solve the problem. The network is trained with the optimal sequences of completely enumerated five, six and seven jobs, ten machine problem and this trained network is then used to solve the problem with greater number of jobs. The sequence obtained using artificial neural network (ANN) is given as the initial sequence to a heuristic proposed by Suliman and also to genetic algorithm (GA) as one of the sequences of the population for further improvement. The approaches are referred as ANN-Suliman heuristic and ANN-GA heuristic respectively. Makespan of the sequences obtained by these heuristics are compared with the makespan of the sequences obtained using the heuristic proposed by Nawaz, Enscore and Ham (NEH) and Suliman Heuristic initialized with Campbell Dudek and Smith (CDS) heuristic called as CDS-Suliman approach. It is found that the ANN-GA and ANN-Suliman heuristic approaches perform better than NEH and CDS-Suliman heuristics for the problems considered.

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

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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

[5]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

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

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

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

[9]  Ling Wang,et al.  A class of order-based genetic algorithm for flow shop scheduling , 2003 .

[10]  Ling Wang,et al.  A modified evolutionary programming for flow shop scheduling , 2003 .

[11]  Michael J. Shaw,et al.  A neural-net approach to real time flow-shop sequencing , 2000 .

[12]  Subramaniam Balakrishnan,et al.  A neural network to enhance local search in the permutation flowshop , 2005, Comput. Ind. Eng..

[13]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

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

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

[16]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

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

[18]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

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

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

[22]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[23]  Wenxin Liu,et al.  A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment , 2005, J. Intell. Manuf..

[24]  Derya Eren Akyol,et al.  Application of neural networks to heuristic scheduling algorithms , 2004, Comput. Ind. Eng..

[25]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

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

[27]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

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

[29]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[30]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[32]  Vinícius Amaral Armentano,et al.  Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..

[33]  Subramaniam Balakrishnan,et al.  Sequencing jobs on a single machine: A neural network approach , 2000, Eur. J. Oper. Res..

[34]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[35]  Izzettin Temiz,et al.  Fuzzy branch-and-bound algorithm for flow shop scheduling , 2004, J. Intell. Manuf..

[36]  Andreas C. Nearchou,et al.  Flow-shop sequencing using hybrid simulated annealing , 2004, J. Intell. Manuf..