Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:JIMS.0000034108.66105.59 | J. Intelligent Manufacturing |
Keywords | Field | DocType |
Multi-agent systems,distributed and parallel computing,simulated annealing,taboo search | Autonomous agent,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Multi-agent system,Portfolio,Nurse scheduling problem,Optimization problem | Journal |
Volume | Issue | ISSN |
15 | 4 | 1572-8145 |
Citations | PageRank | References |
21 | 1.30 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Emin Aydin | 1 | 147 | 9.07 |
| T C Fogarty | 2 | 1147 | 152.53 |