Skip to main content
SpringerLink
Log in

Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling

  • Conference paper
MICAI 2007: Advances in Artificial Intelligence (MICAI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4827))

Included in the following conference series:

Abstract

This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hybrid regarding the solution quality.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29, 495–504 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  3. Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 37, 695–705 (1990)

    Article  MATH  Google Scholar 

  4. Van der Veen, J.A.A., Van Dal, R.: Solvable cases of the no-wait flowshop scheduling problem. Journal of the Operational Research Society 42, 971–980 (1991)

    Article  MATH  Google Scholar 

  5. Chen, C.L., Neppalli, R.V., Aljaber, N.: Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering 30, 919–929 (1996)

    Article  Google Scholar 

  6. Aldowaisan, T., Allahverdi, A.: Total flowtime in no-wait flowshops with separated setup times. Computers and Operations Research 25, 757–765 (1998)

    Article  MATH  Google Scholar 

  7. Aldowaisan, T.: A new heuristic and dominance relations for no-wait flowshops with setups. Computers and Operations Research 28, 563–584 (2000)

    Article  Google Scholar 

  8. Allahverdi, A., Aldowaisan, T.: No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research 7, 245–264 (2000)

    Article  MathSciNet  Google Scholar 

  9. Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32(5), 345–352 (2004)

    Article  Google Scholar 

  10. Aldowaisan, T., Allahverdi, A.: New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30(8), 1219–1231 (2003)

    Article  MATH  Google Scholar 

  11. Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

  12. Fink, A., Voβ, S.: Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151, 400–414 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fink, A., Voβ, S.: HotFrame: a heuristic optimization framework. In: Voß, S., Woodruff, D. (eds.) Optimization software class libraries, pp. 81–154. Kluwer, Boston (2002)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research (2007), doi: 10.1016/j.cor.2006.12.030

    Google Scholar 

  16. Carlier, J.: Ordonnancements a contraintes disjonctives. RAIRO Recherche operationelle 12, 333–351 (1978)

    MATH  MathSciNet  Google Scholar 

  17. Heller, J.: Some numerical experiments for an MxJ flow shop and its decision-theoretical aspects. Operations Research 8, 178–184 (1960)

    MATH  MathSciNet  Google Scholar 

  18. Reeves, C.: A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  19. Rajendran, C.: A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45, 472–479 (1994)

    Article  MATH  Google Scholar 

  20. Syswerda, G.: Uniform crossover in genetic algorithms. In: International Conference on Genetic Algorithms (ICGA), Virginia, USA, pp. 2–9 (1989)

    Google Scholar 

  21. Cotta, C., Troya, J.M.: Genetic Forma Recombination in Permutation Flowshop Problems. Evolutionary Computation 6, 25–44 (1998)

    Google Scholar 

  22. Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) Advances in Artificial Intelligence. LNCS (LNAI), pp. 385–394. Springer, Heidelberg (2004)

    Google Scholar 

  23. Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence. Springer SCI Series, vol. 75, pp. 81–102 (2007)

    Google Scholar 

  24. Glover, F.: Tabu search and adaptive memory programing: Advances, applications and challenges. In: Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculdade Bandeirantes de Educação Superior, R. José Correia Gonçalves, 57, 08675-130, Suzano - SP, Brazil

    Geraldo Ribeiro Filho

  2. Escola de Engenharia de São Carlos - USP, Av. Trabalhador São-Carlense, 400, 13566-590, São Carlos - SP, Brazil

    Marcelo Seido Nagano

  3. Instituto Nacional de Pesquisas Espaciais - INPE/LAC, Av. dos Astronautas, 1758, 12227-010, São José dos Campos - SP, Brazil

    Luiz Antonio Nogueira Lorena

Authors
  1. Geraldo Ribeiro Filho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcelo Seido Nagano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luiz Antonio Nogueira Lorena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander Gelbukh Ángel Fernando Kuri Morales

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ribeiro Filho, G., Nagano, M.S., Lorena, L.A.N. (2007). Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76631-5_105

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76630-8

  • Online ISBN: 978-3-540-76631-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation