Show simple item record

dc.contributor.authorOpiyo, Elisha T O
dc.contributor.authorAyienga, Erick
dc.contributor.authorGetao, Katherine
dc.contributor.authorOkello-Odongo, William
dc.date.accessioned2013-02-20T11:40:46Z
dc.date.issued2008
dc.identifier.citationInternational Journal of Computing and ICT Research, Special Issue Vol. 1, No. 1en
dc.identifier.urihttp://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/10449
dc.description.abstractThis paper considers the scheduling of n independent jobs on m non-identical machines using the ideas from game theory and multi-agent systems. The values of n and m are fixed at 30 and 6 respectively giving a schedule space with a dimension of approximately 1023 schedules. The agents are used to represent the jobs and they select machines on which the jobs should be processed, resulting into schedules. The schedules that are generated are evaluated using the makespan which is the total time taken for all the jobs to be processed. The makespan of the schedules that are generated vary when the agents that represent the jobs change the way they make their selection decisions. The agent selection policies that are investigated in this paper include pure random choice, potential game strategy and dispersion game strategy. The results that are obtained show that the random choice strategy and the potential game strategy generate the empirical best schedules by chance. The dispersion game strategy however is shown to converge very quickly to a stable schedule type whose best makespan value is between 3.1 to 3.4 times larger than the empirical best schedule. The main contributions in this paper include generating schedules in a concrete schedule space using ideas from game theory and multi-agent systems and the results that are obtained.en
dc.language.isoenen
dc.subjectAgentsen
dc.subjectSchedulingen
dc.subjectArtificial Intelligence Applicationsen
dc.subjectMulti-Agent Systemsen
dc.subjectGeneral Termsen
dc.subjectParallel Machines Additional Key Words and Phrasesen
dc.subjectGame theoryen
dc.subjectgrid computersen
dc.titleGame Theoretic Multi-Agent Systems Scheduler for Parallel Machinesen
dc.typeArticleen
local.publisherSchool of Computing and Informaticsen
local.publisherSchool of Computing and Informaticsen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record