Skip to main content
SpringerLink
Log in
Book cover

International Conference on Hybrid Artificial Intelligence Systems

HAIS 2015: Hybrid Artificial Intelligent Systems pp 269–281Cite as

A Metaheuristic Hybridization Within a Holonic Multiagent Model for the Flexible Job Shop Problem

  • Conference paper
  • First Online:

  • 2062 Accesses

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

Abstract

The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines. It is an NP-hard problem consisting of two sub-problems which are the assignment and the scheduling problems. This paper proposes a hybridization of a genetic algorithm with a tabu search within a holonic multiagent model for the FJSP. Firstly, a scheduler agent applies a Neighborhood-based Genetic Algorithm (NGA) for a global exploration of the search space. Secondly, a cluster agents set uses a local search technique to guide the research in promising regions. Numerical tests are made to evaluate our approach, based on two sets of benchmark instances from the literature of the FJSP: Brandimarte and Hurink. The experimental results show the efficiency of our approach in comparison to other approaches.

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 EPUB and 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

References

  1. Bozejko, W., Uchronski, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem. In: The International Conference on Computational Science, pp. 289–296 (2010)

    Google Scholar 

  2. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)

    Article  MATH  Google Scholar 

  3. Ennigrou, M., Ghédira, K.: New local diversification techniques for the flexible job shop problem with a multi-agent approach. Auton. Agent. Multi-Agent Syst. 17(2), 270–287 (2008)

    Article  Google Scholar 

  4. Ferber, J.: Multi-agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley Longman Publishing, Boston (1999)

    Google Scholar 

  5. Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892–2907 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  7. Giret, A., Botti, V.: Holons and agents. J. Intell. Manuf. 15(5), 645–659 (2004)

    Article  Google Scholar 

  8. Glover, F., Kelly, J.P., Laguna, M.: Genetic algorithms and tabu search: Hybrids for optimization. Comput. Oper. Res. 22(1), 111–134 (1995)

    Article  MATH  Google Scholar 

  9. Henchiri, A., Ennigrou, M.: Particle swarm optimization combined with tabu search in a multi-agent model for flexible job shop problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part II. LNCS, vol. 7929, pp. 385–394. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektr. 15(4), 205–215 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241–254 (1967)

    Article  Google Scholar 

  12. Koestler, A.: The Ghost in the Machine. Hutchinson, London (1967)

    Google Scholar 

  13. Lee, K., Yamakawa, T., Lee, K.M.: A genetic algorithm for general machine scheduling problems. In: The second IEEE International Conference on Knowledge-Based Intelligent Electronic Systems, pp. 60–66 (1998)

    Google Scholar 

  14. Mastrolilli, M., Gambardella, L.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3–20 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sonmez, A.I., Baykasoglu, A.: A new dynamic programming formulation of (nm) flow shop sequencing problems with due dates. Int. J. Prod. Res. 36(8), 2269–2283 (1998)

    Article  MATH  Google Scholar 

  16. Zhang, C., Gu, P., Jiang, P.: Low-carbon scheduling and estimating for a flexible job shop based on carbon footprint and carbon efficiency of multi-job processing. J. Eng. Manuf. 39(32), 1–15 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stratégies d’Optimisation et Informatique intelligentE (SOIE), Higher Institute of Management of Tunis, Tunis, Tunisia

    Houssem Eddine Nouri, Olfa Belkahla Driss & Khaled Ghédira

Authors
  1. Houssem Eddine Nouri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olfa Belkahla Driss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Khaled Ghédira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Houssem Eddine Nouri .

Editor information

Editors and Affiliations

  1. University of Deusto, Bilbao, Spain

    Enrique Onieva

  2. University of Deusto, Bilbao, Spain

    Igor Santos

  3. University of Deusto, Bilbao, Spain

    Eneko Osaba

  4. Universidad de Salamanca, Salamanca, Spain

    Héctor Quintián

  5. Universidad de Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nouri, H.E., Driss, O.B., Ghédira, K. (2015). A Metaheuristic Hybridization Within a Holonic Multiagent Model for the Flexible Job Shop Problem. In: Onieva, E., Santos, I., Osaba, E., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2015. Lecture Notes in Computer Science(), vol 9121. Springer, Cham. https://doi.org/10.1007/978-3-319-19644-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19644-2_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19643-5

  • Online ISBN: 978-3-319-19644-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation