Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 2010: Parallel Problem Solving from Nature, PPSN XI pp 280–289Cite as

An Island Model for the No-Wait Flow Shop Scheduling Problem

  • Conference paper

  • 1878 Accesses

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

Abstract

In this paper we present an evolutionary algorithm (EA) for the no-wait flow shop scheduling problem. This is a new island model with special master-slave structure. In all islands runs a hybrid steady-state algorithm that uses truncation selection, uses only mutation for the generation of the descendants and it improves the solutions with two local search procedures. The mutation is based on the new, modified version of ”the EVL method”, that is a memory based method. The algorithm was tested on benchmark problems; its results are similar to or better than the results of the particle swarm optimization algorithms.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldowaisan, T., Allahverdi, A.: New Heuristics for No-wait Flowshops to Minimize Makespan. Comput. Oper. Res. 30, 1219–1231 (2003)

    Article  MATH  Google Scholar 

  2. Borgulya, I.: An Algorithm for the Capacitated Vehicle Routing Problem with Route Balancing. Central European Journal of Operations Research 16(4), 331–344 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. van Deman, J.M., Baker, K.R.: Minimisation mean flow time in flowshop with no intermediate queues. AIIE Trans. 6, 28–34 (1974)

    Article  Google Scholar 

  4. Filho, G.R., Nagano, M.S., Lorena, L.A.N.: Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-wait Flowshop Scheduling. In: Gelbukh, A., Morales, A.F.K. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 1099–1109. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Gangadharan, R., Rajendran, C.: Heuristic Algorithms for Scheduling in the Nowait Flow-shop. Int. J. Prod. Econ. 32, 285–290 (1993)

    Article  Google Scholar 

  6. Grabowski, J., Pempera, J.: Some local search algorithms for no-wait flow-scop problem with makespan criterion. Comput. Oper. Res. 32, 2197–2212 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liu, B., Ling, W., Jin, Y.-H.: An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int. J. Adv. Manuf. Technol. 31, 1001–1011 (2007)

    Article  Google Scholar 

  8. Lin, B.M.T., Cheng, T.C.E.: Batch Scheduling in the No-wait Two-machine Flowshop to Minimize the Makespan. Comput. Oper. Res. 28, 613–624 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Marin, F.J., Trelles-Salazaro, O., Sandoval, F.: Genetic algorithms on LAN-message passing architectures using PVM: Application to the routing problem. In: Davidor, Y., Schwefl, H.P., Männer, R. (eds.) Parallel Problem Solving fron Nature, PPSN III, pp. 534–543. Springer, Berlin (1994)

    Chapter  Google Scholar 

  10. Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Sciences 11, 91–95 (1983)

    Article  Google Scholar 

  11. Pan, Q.-K., Tasgetiren, M.F., Liang, Y.-C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 35, 2807–2839 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rajendran, C.: A No-wait Flowshop Scheduling Heuristic to Minimize Makespan. J. Oper. Res. Soc. 45, 472–478 (1994)

    MATH  Google Scholar 

  13. Schuster, C.J., Framinan, J.M.: Approximative procedures for no-wait job shop scheduling. Oper. Res. Lett. 31(3), 308–318 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shyu, S.J., Lin, B.M.T., Yin, P.-Y.: Application of ant colonyc optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput. Ind. Eng. 47, 181–193 (2004)

    Article  Google Scholar 

  15. Wang, L., Zheng, D.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585–596 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Business and Economics, University of Pecs, Hungary

    Istvan Borgulya

Authors
  1. Istvan Borgulya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Automatics, Computer Science and Electronics, Department of ComputerScience, AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Robert Schaefer

  2. Departamento de Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  3. Department of Mathematics and Computer Science, University of Bielsko-Biala, Willowa 2, 43-309, Bielsko-Biala, Poland

    Joanna Kołodziej

  4. Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany

    Günter Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borgulya, I. (2010). An Island Model for the No-Wait Flow Shop Scheduling Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15871-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15870-4

  • Online ISBN: 978-3-642-15871-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation