Figure 4: Flow chart illustrating the agent merge principle. The algorithm starts with searching for an underloaded agent ( ). When such an entity can be found, there is a second search with possible inclusion of other machines. As soon as two underloaded agents can be found, tasks are merged and assigned to one entity.