Skip to main content
SpringerLink
Log in

An artificial neural network based heuristic for flow shop scheduling problems

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Akyol D. (2004) Application of neural networks to heuristic scheduling algorithms. Computers & Industrial Engineering 46: 679–696

    Article  Google Scholar 

  • Arroyo J. E. C., Armentano V. A. (2005) Genetic local search for multiobjective flowshop scheduling problems. European Journal of Operational Research 167(3): 717–738

    Article  Google Scholar 

  • Campbell H. R., Smith D. M. (1970) A heuristic algorithm for n-jobs m-machines sequencing problem. Management Science 16: 630–637

    Article  Google Scholar 

  • Chen C.-L., Vempati V. S., Aljaber N. (1995) An application of genetic algorithms for flow shop problems. European Journal of Operational Research 80: 389–396

    Article  Google Scholar 

  • Dannenbring D. (1977) An evolution of flowshop scheduling heuristics. Management Science 23: 174–1182

    Google Scholar 

  • El-bouri A., Subramaniam B., Popplewell N. (2000) Sequencing jobs on a single machine: A neural network approach. European Journal of Operational Research 126: 474–490

    Article  Google Scholar 

  • El-bouri A., Subramaniam B., Popplewell N. (2005) A neural network to enhance local search in the permutation flowshop. Computers & Industrial Engineering 49: 182–196

    Article  Google Scholar 

  • French S. (1982) Sequencing and scheduling—an introduction to the mathematics of the job-shop. Ellis Horwood, Chichester, UK. West Sussex, England

    Google Scholar 

  • Garey M. R., Johnson D. S., Sethi R. (1976) The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2): 117–129

    Article  Google Scholar 

  • Gupta J. (1971) A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly 22: 27–39

    Article  Google Scholar 

  • Ho J. C., Chang Y.-L. (1991) A new heuristic for the n-jobs, m-machine flowshop scheduling problem. European Journal of Operational Research 52: 194–202

    Article  Google Scholar 

  • Holland J. (1975) Adaptation in natural and artificial systems. University of Michigian Press, Ann Arbor, MI

    Google Scholar 

  • Johnson S. (1954) Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1(1): 61–68

    Article  Google Scholar 

  • Kirkpatrick S., Gelatt C. D., Vecchi M. P. (1983) Optimization by simulated annealing. Science 220: 671–680

    Article  Google Scholar 

  • Koulamas C. (1998) A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research Society 105: 66–71

    Article  Google Scholar 

  • Lee, Shaw M. J. (2000) A neural-net approach to real time flow shop sequencing. Computers & Industrial Engineering 38: 125–147

    Article  Google Scholar 

  • Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. (1953) Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21: 1087–1092

    Article  Google Scholar 

  • Murata T., Ishibuchi H., Tanaka H. (1996) Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering 30(4): 1061–1071

    Article  Google Scholar 

  • Nawaz M., Enscore J., Ham I. (1983) A Heuristic algorithm for the mmachine, n-job flow shop sequencing problem. OMEGA. International Journal of Management Science 11(1): 91–95

    Google Scholar 

  • Nearchou A. C. (2004) Flow shop sequencing using hybrid simulated annealing. International Journal of Intelligent Manufacturing 15: 317–328

    Article  Google Scholar 

  • Neppalli V. R., Chen C.-L., Gupta J. N. D. (1996) Genetic algorithms for the two stage bicriteria flow shop problem. European Journal of Operational Research 95(2): 356–373

    Article  Google Scholar 

  • Nowicki E., Smutnicki C. (1996) A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91(10): 160–175

    Article  Google Scholar 

  • Ogbu F. A., Smith D. K. (1990) The application Of the simulated annealing algorithm to the solution of the N/M/Cmax flow shop problem. Computers &Operations Research 17: 243–253

    Article  Google Scholar 

  • Osman I. H., Potts C. N. (1989) Simulated annealing for permutation flow shop scheduling. Omega 17(6): 551–557

    Article  Google Scholar 

  • Palmer D. (1965) Sequencing jobs through a multi-stage. Process in the minimum total time—a quick method of obtaining a near optimum. Operations Research 16: 45–61

    Google Scholar 

  • Rajendran C. (1995) Theory and methodology heuristics for scheduling in flow shop with multiple objectives. European Journal of Operational Research 82: 540–555

    Article  Google Scholar 

  • Reeves C. (1995) A genetic algorithm for flow shop sequencing. Computers & Operations Research 22: 5–13

    Article  Google Scholar 

  • Sabuncuoglu I., Gurgun B. (1996) A neural network model for scheduling problems. European Journal of Operational Research 93: 288–299

    Article  Google Scholar 

  • Sridhar J., Rajendran C. (1996) Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach. Production Planning and Control 7: 374–382

    Article  Google Scholar 

  • Suliman S. (2000) A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 64: 143–152

    Article  Google Scholar 

  • Taillard E. (1990) Some efficient heuristic methods for flow shop sequencing problem. European Journal of Operational Research 47: 65–74

    Article  Google Scholar 

  • Taillard E. (1993) Benchmark for basic scheduling problems. European Journal of Operational Research 64: 278–285

    Article  Google Scholar 

  • Tang L., Liu W., Liu J. (2005) A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing 16: 361–370

    Google Scholar 

  • Temiz I., Erol S. (2004) Fuzzy branch and bound algorithm for flow shop scheduling. International Journal of Intelligent Manufacturing 15: 449–454

    Article  Google Scholar 

  • Wang L., Zheng D. Z. (2003) A modified evolutionary programming for flow shop scheduling. International Journal of Advanced Manufacturing Technology 22(7/8): 522–527

    Article  Google Scholar 

  • Wang L., Zheng D. Z. (2003) An effective hybrid heuristic for flow shop scheduling. International Journal of Advanced Manufacturing Technology 21(1): 38–44

    Article  Google Scholar 

  • Wang L., Zhang L., Zheng D. Z. (2003) A class of order-based genetic algorithm for flow shop scheduling. International Journal of Advanced Manufacturing Technology 22(11/12): 828–835

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, National Institute of Technology Calicut, NIT Campus P.O, Calicut, 673601, Kerala, India

    T. Radha Ramanan, R. Sridharan, Kulkarni Sarang Shashikant & A. Noorul Haq

Authors
  1. T. Radha Ramanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Sridharan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kulkarni Sarang Shashikant
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. Noorul Haq
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. Radha Ramanan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramanan, T.R., Sridharan, R., Shashikant, K.S. et al. An artificial neural network based heuristic for flow shop scheduling problems. J Intell Manuf 22, 279–288 (2011). https://doi.org/10.1007/s10845-009-0287-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-009-0287-5

Keywords

Search

Navigation