Skip to main content
SpringerLink
Log in

Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

Abstract

This paper presents the performance study of a Genetic Algorithm applied to a mixed model non-permutation flowshop production line. Resequencing is permitted where stations have access to intermittent or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. Characteristics such as the difference between the intermittent and the centralized case, the number of buffer places and the distribution of the buffer places are analyzed. Improvements that come with the introduction of constrained resequencing buffers are highlighted.

This work is partially supported by the Ministry of Science and Technology, and the funding for regional research DPI2004-03472.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Ignall, E., Schrage, L.: Application of the branch and bound technique to some flow-shop problems. Operations Research 13(3), 400–412 (1965)

    Article  MathSciNet  Google Scholar 

  2. Potts, C.: An adaptive branching rule for the permutation flowshop problem. European Journal of Operational Research 5(2), 19–25 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Carlier, J., Rebai, I.: Two branch and bound algorithms for the permutation flowshop problem. European Journal of Operational Research 90(2), 238–251 (1996)

    Article  MATH  Google Scholar 

  4. Framinan, J., Gupta, J., Leisten, R.: A review and classification of heuristics for permuation flowshop scheduling with makespan objective. Technical Report OI/PPC-2001/02 (2002), Version 1, 2

    Google Scholar 

  5. Framinan, J., Leisten, R.: Comparison of heuristics for flowtime minimisation in permuation flowshops. Technical Report IO-2003/01 (2003), Version 0.5

    Google Scholar 

  6. Potts, C., Shmoys, D., Williamson, D.: Permutation vs. non-permutation flow shop schedules. Operations Research Letters 10(5), 281–284 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lee, H., Schaefer, S.: Sequencing methods for automated storage and retrieval systems with dedicated storage. Computers and Industrial Engineering 32(2), 351–362 (1997)

    Article  Google Scholar 

  8. Lahmar, M., Ergan, H., Benjaafar, S.: Resequencing and feature assignment on an automated assembly line. IEEE Transactions on Robotics and Automation 19(1), 89–102 (2003)

    Article  Google Scholar 

  9. Engstrőm, T., Jonsson, D., Johansson, B.: Alternatives to line assembly: Some swedish examples. International Journal of Industrial Ergonomics 17(3), 235–245 (1996)

    Article  Google Scholar 

  10. Rachakonda, P., Nagane, S.: Simulation study of paint batching problem in automobile industry (2000), http://sweb.uky.edy/~pkrach0/Projects/MFS605Project.pdf (consulted 14.07.2004)

  11. Bolat, A.: Sequencing jobs on an automobile assembly line: objectives and procedures. International Journal of Production Research 32(5), 1219–1236 (1994)

    Article  MATH  Google Scholar 

  12. Holland, J.: Genetic algorithms and the optimal allocation of trials. SIAM J. Comput. 2(2), 88–105 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  13. Holland, J.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  14. Bolat, A., Al-Harkan, I., Al-Harbi, B.: Flow-shop scheduling for three serial stations with the last two duplicate. Computers & Operations Research 32(3), 647–667 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Levitin, G., Rubinovitz, J., Shnits, B.: A genetic algorithm for robotic assembly line balancing. European Journal of Operational Research 168, 811–825 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wang, L., Zhang, L., Zheng, D.: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers & Operations Research (2006) (article in Press)

    Google Scholar 

  17. Rubén, R., Concepción, M.: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169(3), 781–800 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Michaelewicz, Z.: Gentic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)

    Google Scholar 

  19. Balasko, B., Abonyi, J., Feil, B.: Fuzzy clustering and data analysis toolbox; for use with matlab (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Organización y Control de Sistemas Industriales (IOC), Universidad Politécnica de Cataluña (UPC), Barcelona, Spain

    Gerrit Färber & Anna M. Coves Moreno

Authors
  1. Gerrit Färber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna M. Coves Moreno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Färber, G., Moreno, A.M.C. (2006). Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_68

Download citation

  • DOI: https://doi.org/10.1007/11751595_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation