A Holonic Multiagent Model Based on a Combined Genetic Algorithm─Tabu Search for the Flexible Job Shop Scheduling Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Holonic Multiagent Model Based on a Combined Genetic Algorithm─Tabu Search for the Flexible Job Shop Scheduling Problem

  • Conference paper
  • First Online:
Highlights of Practical Applications of Agents, Multi-Agent Systems, and Sustainability - The PAAMS Collection (PAAMS 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 524))

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 holonic multiagent model based on a combined genetic algorithm and tabu search 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: Kacem 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 to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Bellifemine, F., Poggi, A., Rimassa, G.: JADE - a FIPA-compliant agent framework. In: The fourth International Conference and Exhibition on The Practical Application of Intelligent Agents and Multi-Agent Technology, pp. 97–108 (1999)

    Google Scholar 

  2. 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 

  3. Chen, H., Ihlow, J., Lehmann, C.: A genetic algorithm for flexible job-shop scheduling. In: The IEEE International Conference on Robotics and Automation, pp. 1120–1125 (1999)

    Google Scholar 

  4. 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 

  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. Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektrum 15(4), 205–215 (1994)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  9. Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3–5), 245–276 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lawrence, S.: Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, GSIA, Carnegie-Mellon University, Pittsburgh (1984)

    Google Scholar 

  11. 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 

  12. Li, J., Pan, Q., Suganthan, P., Chua, T.: A hybrid tabu search algorithm with an efficient neighbourhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 52(5), 683–697 (2011)

    Article  Google Scholar 

  13. 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 

  14. 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 

  15. Xing, L., Chen, Y., Wang, P., Zhao, Q., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888–896 (2010)

    Article  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 

  17. Ziaee, M.: A heuristic algorithm for solving flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 71(1–4), 519–528 (2014)

    Article  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. Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, Madrid, Spain

    Javier Bajo

  2. University of Southern Denmark, Odense, Denmark

    Kasper Hallenborg

  3. Faculty of Engineering Management, Poznan University, Poznan, Poland

    Pawel Pawlewski

  4. Departamento de Sistemas Informáticos y Computación, Polytechnic University of Valencia, Valencia, Spain

    Vicente Botti

  5. Fluminense Federal University, Rio de Janeiro, Brazil

    Nayat Sánchez-Pi

  6. Universidad Nacional de Colombia, Manizales, CALDAS, Colombia

    Nestor Darío Duque Méndez

  7. Lab. Nacional de Energia e Geologia, Lisbon, Portugal

    Fernando Lopes

  8. Universidad Politécnica de Valencia, Valencia, Spain

    Vicente Julian

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 Holonic Multiagent Model Based on a Combined Genetic Algorithm─Tabu Search for the Flexible Job Shop Scheduling Problem. In: Bajo, J., et al. Highlights of Practical Applications of Agents, Multi-Agent Systems, and Sustainability - The PAAMS Collection. PAAMS 2015. Communications in Computer and Information Science, vol 524. Springer, Cham. https://doi.org/10.1007/978-3-319-19033-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19033-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19032-7

  • Online ISBN: 978-3-319-19033-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics