Skip to main content
SpringerLink
Log in

Multi-agent Model Based on Tabu Search for the Permutation Flow Shop Scheduling Problem

  • Conference paper
Distributed Computing and Artificial Intelligence, 11th International Conference

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 290))

Abstract

In this work, we suggest a Multi-Agent model based on a tabu search method for solving the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. The objective of this work is to minimize the makespan or the total duration of the schedule. The proposed model is composed of two classes of agents: Supervisor agent, responsible for generating the initial solution and containing the tabu search core, and Scheduler agents which are responsible for the satisfaction of the constraints under their jurisdiction and the evaluation of all the neighborhood solutions generated by the Supervisor agent. Computational experiments on different benchmarks data sets demonstrate that the proposed model reaches high-quality solutions.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Graham, R.L., Lawler, E., Lenstra, J.K., Rinnooy Kan, A.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics 5, 236–287 (1979)

    MathSciNet  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  3. Johnson, S.M.: Optimal two- and three-stage productionschedules with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)

    Article  Google Scholar 

  4. Ladhari, T., Haouari, M.: A computational study of the permutationflow shop problem based on a tight lower bound. Computers & Operations Research 32, 1831–1847 (2005)

    Article  MATH  Google Scholar 

  5. Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristicalgorithm for the n job, m machine sequencing problem. Management Science 16(10), B630–B637 (1970)

    Google Scholar 

  6. Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Management Scienc 23(1), 1174–1182 (1977)

    Article  MATH  Google Scholar 

  7. Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA: The International Journal of Management Science 11(1), 91–95 (1983)

    Article  Google Scholar 

  8. Dong, X., Huang, H., Chen, P.: An improved NEH-based heuristic for the permutation flow shop problem. Computers & Operations Research 35(12), 3962–3968 (2008)

    Article  MATH  Google Scholar 

  9. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flow shop scheduling problem. European Journal of Operational Research 177, 2033–2049 (2007)

    Article  MATH  Google Scholar 

  10. Ekşioğlu, B., Ekşioğlu, S.D., Jain, P.: A tabu search algorithm for the flow shop scheduling problem with changing neighborhoods. Computers & Industrial Engineering 54(1), 1–11 (2008)

    Article  Google Scholar 

  11. Liu, Y.F., Liu, S.Y.: A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Applied Soft Computing 13(3), 1459–1463 (2013)

    Article  Google Scholar 

  12. Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533–549 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research: Project Management and Scheduling 165(2), 479–494 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Taillard, E.: Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Deroussi, L., Gourgand, M., Norre, S.: Une adaptation efficace des mouvements de Lin et Kernighan pour le flow-shop de permutation. In: 8éme Conférence Internationale de MOdélisation et SIMulation: MOSIM, Hammamet, Tunisie (2010)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Reeves, C., Yamada, T.: Genetic algorithms, path relinking and the flow shop sequencing problem. Evolutionary Computation 6, 45–60 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stratégies d’Optimisation et Informatique intelligentE (SOIE), High Institute of Management, University of Tunis, 41, Street of Liberty Bouchoucha-City, CP-2000, Bardo Tunis, Tunisia

    Hafewa Bargaoui

  2. Higher Business School of Tunis, University of Manouba, Manouba, Tunisia

    Olfa Belkahla Driss

Authors
  1. Hafewa Bargaoui
    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

Corresponding author

Correspondence to Hafewa Bargaoui .

Editor information

Editors and Affiliations

  1. Faculty of Engineering, Osaka Institute of Technology, Osaka, Osaka, Japan

    Sigeru Omatu

  2. Université Libre de Bruxelles, Bruxelles, Belgium

    Hugues Bersini

  3. Dept. of Computing Science and Control Faculty of Science, University of Salamanca, Salamanca, Spain

    Juan M. Corchado

  4. Department of Computing Science and Control, Faculty of Science, University of Salamanca, Salamanca, Spain

    Sara Rodríguez

  5. Faculty of Engineering Management, Poznan University of Technology, Poznan, Poland

    Paweł Pawlewski

  6. Dep. PPEQS, Section of Economics and Quantitative Methods, University of Chieti-Pescara, Pescara, Italy

    Edgardo Bucciarelli

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bargaoui, H., Driss, O.B. (2014). Multi-agent Model Based on Tabu Search for the Permutation Flow Shop Scheduling Problem. In: Omatu, S., Bersini, H., Corchado, J., Rodríguez, S., Pawlewski, P., Bucciarelli, E. (eds) Distributed Computing and Artificial Intelligence, 11th International Conference. Advances in Intelligent Systems and Computing, vol 290. Springer, Cham. https://doi.org/10.1007/978-3-319-07593-8_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07593-8_60

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07592-1

  • Online ISBN: 978-3-319-07593-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation