Home > Research > Publications & Outputs > Heuristics for the optimal routing of customers...
View graph of relations

Heuristics for the optimal routing of customers in queueing systems with heterogeneous service stations

Research output: Contribution to conference - Without ISBN/ISSN Abstract

Published

Standard

Heuristics for the optimal routing of customers in queueing systems with heterogeneous service stations. / Shone, Robert.
2014. Abstract from IFORS 2014, Barcelona, Spain.

Research output: Contribution to conference - Without ISBN/ISSN Abstract

Harvard

APA

Vancouver

Author

Bibtex

@conference{2afd2fc1184d4e5283269bd29f4089e1,
title = "Heuristics for the optimal routing of customers in queueing systems with heterogeneous service stations",
abstract = "The problem of routing customers to parallel heterogeneous service stations in such a way as to optimise a queueing system{\textquoteright}s performance is known to be one for which optimal policies are difficult to characterise. The application of dynamic programming is impractical in problems of realistic size, and there is a need for effective heuristics to be developed. Some possible approaches to the problem include the development of indices for the stations similar to the Gittins indices for multi-armed bandit problems, and simulation-based methods including those based on artificial neural networks.",
author = "Robert Shone",
year = "2014",
language = "English",
note = "IFORS 2014 ; Conference date: 13-07-2014 Through 18-07-2014",

}

RIS

TY - CONF

T1 - Heuristics for the optimal routing of customers in queueing systems with heterogeneous service stations

AU - Shone, Robert

PY - 2014

Y1 - 2014

N2 - The problem of routing customers to parallel heterogeneous service stations in such a way as to optimise a queueing system’s performance is known to be one for which optimal policies are difficult to characterise. The application of dynamic programming is impractical in problems of realistic size, and there is a need for effective heuristics to be developed. Some possible approaches to the problem include the development of indices for the stations similar to the Gittins indices for multi-armed bandit problems, and simulation-based methods including those based on artificial neural networks.

AB - The problem of routing customers to parallel heterogeneous service stations in such a way as to optimise a queueing system’s performance is known to be one for which optimal policies are difficult to characterise. The application of dynamic programming is impractical in problems of realistic size, and there is a need for effective heuristics to be developed. Some possible approaches to the problem include the development of indices for the stations similar to the Gittins indices for multi-armed bandit problems, and simulation-based methods including those based on artificial neural networks.

M3 - Abstract

T2 - IFORS 2014

Y2 - 13 July 2014 through 18 July 2014

ER -