Teams of autonomous agents for job-shop scheduling problems: An experimental study

Fogarty, Terence C.; Aydin, Mehmet Emin

Abstract

ATeams - teams of autonomous agents co-operating by sharing solutions through a common memory-have been proposed as a means of solving combinatorial optimization problems. In this paper, the ATeam architecture is tested on the job-shop scheduling problem. The results show that the method can work, but that it depends on the portfolio of agents and on the way in which the memory is managed.

Citation

Fogarty, T. C., & Aydin, M. E. (2004). Teams of autonomous agents for job-shop scheduling problems: An experimental study. Journal of Intelligent Manufacturing, 15(4), 455-462. https://doi.org/10.1023/B%3AJIMS.0000034108.66105.59

• Journal Article Type: Conference Paper
• Publication Date: Aug 1, 2004
• Journal: Journal of Intelligent Manufacturing
• Print ISSN: 0956-5515
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 15
• Issue: 4
• Pages: 455-462
• DOI: https://doi.org/10.1023/B%3AJIMS.0000034108.66105.59
• Keywords: multi-agent systems, distributed and parallel computing, simulated annealing, tabu search
• Public URL: https://uwe-repository.worktribe.com/output/1058828
• Publisher URL: http://dx.doi.org/10.1023/B:JIMS.0000034108.66105.59