Abstract
DSAFO (Dynamic Scheduling Agents with Federation Organization) is a novel multi-agent constraint satisfaction algorithm for AGSS problem (a NP-hard scheduling problem). This paper improves on DSAFO by employing a resource requisition strategy, and models this parallel multi-agent algorithm in polyadic π-calculus. The time complexity of the improved DSAFO is \(\mathrm{O}(n^3)+\mathrm{O}(n^2)\times t_{\mathrm{trans}}\). Experiments show improved DSAFO performs well in AGSS consumptions optimization of resources and man-days. Though it is unstable, improved DSAFO makes good probability to find better solutions than classical heuristics and its distributed and parallel agents viewpoint is potential to deal with distributed dynamic troubles in real applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, W., Xue, F. (2006). Optimize Cooperative Agents with Organization in Distributed Scheduling System. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)