Skip to main content

Performance of Genetic Algorithms in the Solution of Permutation Flowshop Problem

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

Scope of this paper is to investigate the applicability of Genetic Algorithms to the solution of Static Permutation Flowshop problem and to compare their performance with those obtained with Taboo Search Algorithms. Since in order to obtain good results with Genetic Algorithms (Gas) it is necessary to tune a set of parameters, then a second purpose of the study is to devise a methodology to perform this tuning. The methodology used is the “Response Surface Methodology”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bolognini, R. Borelli, T. Tolio, Q. Semeraro: Influence of the structure of Static Permutation Flowshop problem on the performance of Single Shot Heuristics. Computers ind. Engng. Vol.26,N°3, pp 437–450, (1994).

    Article  Google Scholar 

  2. M. Bolognini, R. Borelli, T. Tolio, Q. Semeraro:.Analysis and Evaluation of Taboo Search Heuristics for Scheduling of a Static Permutation Flowshop Proceeding Computer-Aided Production Engineering. Edinburgh (1992).

    Google Scholar 

  3. Colin Reeves. Genetic Algorithm for Flow Shop Sequencing. Computers &Opns.Res

    Google Scholar 

  4. A. Wetzel. Evaluation of the Effectiveness of genetic algorithms in combinatorial optimization. Unpublished manuscript, University of Pittsburgh (1983).

    Google Scholar 

  5. D. Whitley. GENITOR:a different genetic algorithm. In proceedings of the Rocky Mountain Conference on Artificial Intelligence. Denver, Colo (1988).

    Google Scholar 

  6. D.E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley. (1989)

    MATH  Google Scholar 

  7. James C. Bean. Genetic and Random Keys for Sequencing and Optimization. Technical Report, Department of Industrial & Operations Engineering University Michigan(1992).

    Google Scholar 

  8. I. M. Oliver, D.J.Smith and J.R.C. Holland. International Conference on Genetic Algorithms and their Application.224-230. 1987. A Study of Permutation Crossover Operators on the Travelling Salesman problem. Proc. 2nd.

    Google Scholar 

  9. André I. Khuri, John A. Cornell. Response Surfaces Designs and Analyses. Marcel Dekker. lnc. ASQC Quality Press. New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Sangalli, N., Semeraro, Q., Tolio, T. (1995). Performance of Genetic Algorithms in the Solution of Permutation Flowshop Problem. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_128

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7535-4_128

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82692-8

  • Online ISBN: 978-3-7091-7535-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics