Distributed resource allocation via local choices: A case study of workforce allocation

  • Authors:
  • Marian F. Ursu;Botond Virginas;Gilbert Owusu;Chris Voudouris

  • Affiliations:
  • Department of Computing, Goldsmiths College, University of London, London, SE14 6NW, UK (Corresponding author. Tel.: +44 (0)20 7919 7073/ Fax: +44 (0)20 7919 7853);Intelligent Systems Lab, BT Exact, Adastral Park, Ipswich, IP5 3RE, UK;Intelligent Systems Lab, BT Exact, Adastral Park, Ipswich, IP5 3RE, UK;Intelligent Systems Lab, BT Exact, Adastral Park, Ipswich, IP5 3RE, UK

  • Venue:
  • International Journal of Knowledge-based and Intelligent Engineering Systems - Selected papers from the KES2004 conference
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a solution to workforce allocation, modelled as a distributed system. The novelty of the solution resides in the fact that it is a natural and versatile formulation that combines an agent-based model with rule-based expressions of allocation strategies and multi-criteria optimisation expressions of allocation objectives. The problem space is structured on disjoint domains. Each domain has two agents: one in charge of its engineers and one in charge of its jobs. In the implemented system, agents have complete decision power over the allocation of their resources/requirements. However, the general solution is readily extendable towards the inclusion of central agents with specialist roles. Workforce allocation is modelled here as an iterative communication process, based on a 4-step communication protocol, between workforce/engineers' agents, on one hand, and jobs agents, on the other. Choices (decisions) regarding the allocation are made locally, within each agent. A global allocation emerges from this interaction/communication. The paper describes the context of this solution (including the problem description), the general model and solution, and specific implementations. The latter illustrate the emergence of good global solutions from the distributed algorithm.