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

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.