The degree of dynamism for workforce scheduling problem with stochastic task duration

Authors:
Yossi Borenstein;Abdullah Alsheddy;Edward Tsang;Nazaraf Shah
Affiliations:
University of Essex, Colchester, United Kingdom;University of Essex, Colchester, United Kingdom;University of Essex, Colchester, United Kingdom;University of Essex, Colchester, United Kingdom
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 10
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance

Transportation Science
Dynamic Workforce Scheduling for British Telecommunications plc

Interfaces
iSchedule — An Optimisation Tool-Kit Based on Heuristic Search to Solve BT Scheduling Problems

BT Technology Journal
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

Operations Research
The A Priori Dynamic Traveling Salesman Problem with Time Windows

Transportation Science
Waiting Strategies for Dynamic Vehicle Routing

Transportation Science
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching

Transportation Science
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real time dispatching strategies in a dynamic environment is a growing area of interest. Most of current work focuses mainly on two dynamic aspects of the problem, namely dynamic arrival of jobs and dynamic travel time. The degree of dynamism, for example is defined with respect to dynamic arrival of jobs. This paper focuses on another dynamic aspect, namely the duration of tasks. This aspect becomes important when tasks durations are relatively long and, in addition, one has to respect time windows. We characterize the degree of dynamism of such problems and show that it relates with the expected cost of a static scheduler which is reapplied in light of dynamic events. Furthermore, preliminary experiments indicate that the performance of the scheduler can be improved when the expected duration of a task is overestimated.