Applying Multi-Agent Algorithm to a Class Scheduling System | Zendy

Eiji Nunohiro | Zendy; Kenneth J. Mackin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Applying Multi-Agent Algorithm to a Class Scheduling System

Author(s) -

Eiji Nunohiro,

Kenneth J. Mackin

Publication year - 2005

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2005.p0314

Subject(s) - computer science , dynamic priority scheduling , fair share scheduling , scheduling (production processes) , rate monotonic scheduling , negotiation , two level scheduling , round robin scheduling , distributed computing , job shop scheduling , multi agent system , mathematical optimization , algorithm , artificial intelligence , schedule , mathematics , operating system , political science , law

We propose a multi-agent algorithm to solve a scheduling problem. The proposed application takes into account various restrictions relative to Japanese university class scheduling in particular. A multi-agent system consisting of agents representing the requirements and restrictions for professors and departments are introduced. Scheduling is solved using negotiation between agents together with the hill-climbing method. Through a software simulation, we were able to show that our proposed method successfully applies the self-organizing nature of agents to solve the scheduling problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research