Skip to main content
SpringerLink
Log in

Parallel Meta2heuristics for the Flexible Job Shop Problem

  • Conference paper
Artifical Intelligence and Soft Computing (ICAISC 2010)

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

Included in the following conference series:

Abstract

In this paper we consider a double-level metaheuristic optimization algorithm. The algorithm proposed here includes two major modules: the machine selection module which is executed sequentially, and the operation scheduling module executed in parallel. On each level a metaheuristic algorithm is used, so we call this method meta2heuristics. We carry out computational experiment using Graphics Processing Units (GPU). It was possible to obtain new the best known solutions for the benchmark instances from the literature.

The work was supported by MNiSW Poland, within the grant No. N N514 232237.

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.

References

  1. Barnes, J.W., Chambers, J.B.: Flexible job shop scheduling by tabu search. Graduate program in operations research snd industrial engineering, The University of Texas at Austin, Technical Report Series: ORP96-09 (1996)

    Google Scholar 

  2. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 41, 157–183 (1993)

    Article  MATH  Google Scholar 

  3. Dauzère-Pérès, S., Pauli, J.: An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Annals of Operations Research 70(3), 281–306 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research 35, 2892–2907 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grabowski, J.: Generalized problems of operations sequencing in the discrete production systems. In: Monographs, vol. 9. Scientific Papers of the Institute of Technical Cybernetics of Wrocław Technical Univercity (1979) (in Polish)

    Google Scholar 

  6. Mastrolilli, M., Gambardella, L.M.: Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3(1), 3–20 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the Flexible Job-schop Scheduling Problem. Computers & Operations Research 35, 3202–3212 (2008)

    Article  MATH  Google Scholar 

  9. Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood Cliffs (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko & Mariusz Uchroński

  2. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Mieczysław Wodecki

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz Uchroński
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Academy of Humanities and Economics in Łódź, ul. Rewolucji 1905 nr 64, Łódź, Poland

    Rafał Scherer

  3. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley Initiative in Soft Computing (BISC), 94720-1776, CA

    Lotfi A. Zadeh

  5. Computational Intelligence Laboratory Department of Electrical and Computer Engineering, University of Louisville, 40292, Louisville, KY

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bożejko, W., Uchroński, M., Wodecki, M. (2010). Parallel Meta2heuristics for the Flexible Job Shop Problem. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artifical Intelligence and Soft Computing. ICAISC 2010. Lecture Notes in Computer Science(), vol 6114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13232-2_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13232-2_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13231-5

  • Online ISBN: 978-3-642-13232-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation