Skip to main content

Multiagent Systems Viewed as Distributed Scheduling Systems: Methodology and Experiments

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2005)

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

  • 1249 Accesses

Abstract

In this article, we present a design technique that facilitates the work of extracting and defining the tasks scheduling problem for a multiagent system. We also compare a centralized scheduling approach to a decentralized scheduling approach to see the difference in the efficiency of the schedules and the amount of information transmitted between the agents. Our experimental results show that the decentralized approach needs less messages, while being as efficient as the centralized approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Mali, A.D., Kambhampati, S.: Distributed Planning. In: The Encyclopaedia of Distributed Computing. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  2. Durfee, E.H.: Distributed Problem Solving and Planning. In: Weiss, G. (ed.) Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pp. 121–164. The MIT Press, Cambridge (1999)

    Google Scholar 

  3. French, S.: Sequencing and Scheduling. Wiley, Chichester (1982)

    MATH  Google Scholar 

  4. Lawer, E., Lenstra, J., Kan, A.R.: Recent developments in deterministic sequencing scheduling: A servey. Deterministic and Stochastic Scheduling, 35–74 (1982)

    Google Scholar 

  5. Blazewick, J.: Scheduling computer and manufacturing processes. Springer, Heidelberg (2001)

    Google Scholar 

  6. Kitano, H.: Robocup rescue: A grand challenge for multi-agent systems. In: Proceedings of ICMAS 2000, Boston, MA (2000)

    Google Scholar 

  7. Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  8. Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science, University of California, Berkeley (1955)

    Google Scholar 

  9. Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paquet, S., Bernier, N., Chaib-draa, B. (2005). Multiagent Systems Viewed as Distributed Scheduling Systems: Methodology and Experiments. In: Kégl, B., Lapalme, G. (eds) Advances in Artificial Intelligence. Canadian AI 2005. Lecture Notes in Computer Science(), vol 3501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424918_6

Download citation

  • DOI: https://doi.org/10.1007/11424918_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25864-3

  • Online ISBN: 978-3-540-31952-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics