• Login
    View Item 
    •   Mak IR Home
    • College of Computing and Information Sciences (CoCIS)
    • School of Computing and Informatics Technology (CIT)
    • School of Computing and Informatics Technology (CIT) Collection
    • View Item
    •   Mak IR Home
    • College of Computing and Information Sciences (CoCIS)
    • School of Computing and Informatics Technology (CIT)
    • School of Computing and Informatics Technology (CIT) Collection
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Game theoretic multi-agent systems scheduler for parallel machines

    Thumbnail
    View/Open
    opiyo-ayienga-getao-okello-manderick-nowe_cit-conf.pdf (330.7Kb)
    Date
    2008
    Author
    Opiyo, Elisha T. O.
    Ayienga, Erick
    Getao, Katherine
    Okello-Odongo, William
    Manderick, Bernard
    Nowé, Ann
    Metadata
    Show full item record
    Abstract
    This 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.
    URI
    http://hdl.handle.net/10570/840
    Collections
    • School of Computing and Informatics Technology (CIT) Collection

    DSpace 5.8 copyright © Makerere University 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of Mak IRCommunities & CollectionsTitlesAuthorsBy AdvisorBy Issue DateSubjectsBy TypeThis CollectionTitlesAuthorsBy AdvisorBy Issue DateSubjectsBy Type

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    DSpace 5.8 copyright © Makerere University 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV