Research Repository

On the partitioning of dynamic workforce scheduling problems

Borenstein, Y and Shah, N and Tsang, E and Dorne, R and Alsheddy, A and Voudouris, C (2010) 'On the partitioning of dynamic workforce scheduling problems.' Journal of Scheduling, 13 (4). 411 - 425. ISSN 1094-6136

Full text not available from this repository.

Abstract

This problem is based on the British Telecom workforce scheduling problem, in which technicians (with different skills) are assigned to tasks (which require different skills) which arrive (partially) dynamically during the day. In order to manage their workforce, British Telecom divides the different regions into several areas. At the beginning of each day all the technicians in a region are assigned to one of these areas. During the day, each technician is limited to tasks within the assigned area. This effectively decomposes a large dynamic scheduling problem into smaller problems. On one hand, it makes the problem more manageable. On the other hand, it gives rise to, potentially, a mismatch between technicians and tasks within an area. Furthermore, it prevents technicians from being assigned a job which is just outside their area but happens to be close to where they are currently working. This paper studies the effect of the number of partitions on the expected objective (number of completed tasks) that a rule-based system (responsible for the dynamic assignment and reassignment of tasks to resources following dynamic events) can reach. © 2009 Springer Science+Business Media, LLC.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 19 Nov 2013 16:37
Last Modified: 17 Aug 2017 17:54
URI: http://repository.essex.ac.uk/id/eprint/8532

Actions (login required)

View Item View Item