Home > Research > Publications & Outputs > Dynamic routing of customers with general delay...

Research

Electronic data

Text available via DOI:

View graph of relations

Dynamic routing of customers with general delay costs

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

Dynamic routing of customers with general delay costs. / Argon, N T; Ding, L; Glazebrook, K D et al.
In: Probability in the Engineering and Informational Sciences, Vol. 23, 2009, p. 175-203.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Argon, NT, Ding, L, Glazebrook, KD & Ziya, S 2009, 'Dynamic routing of customers with general delay costs', Probability in the Engineering and Informational Sciences, vol. 23, pp. 175-203. https://doi.org/10.1017/S0269964809000138, https://doi.org/http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=3999616

APA

Argon, N. T., Ding, L., Glazebrook, K. D., & Ziya, S. (2009). Dynamic routing of customers with general delay costs. Probability in the Engineering and Informational Sciences, 23, 175-203. https://doi.org/10.1017/S0269964809000138, https://doi.org/http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=3999616

Vancouver

Argon NT, Ding L, Glazebrook KD, Ziya S. Dynamic routing of customers with general delay costs. Probability in the Engineering and Informational Sciences. 2009;23:175-203. doi: 10.1017/S0269964809000138, http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=3999616

Author

Argon, N T ; Ding, L ; Glazebrook, K D et al. / Dynamic routing of customers with general delay costs. In: Probability in the Engineering and Informational Sciences. 2009 ; Vol. 23. pp. 175-203.

Bibtex

@article{854c64b767bb461fa4c7ea517fbdcc9c,
title = "Dynamic routing of customers with general delay costs",
abstract = "We consider a network of parallel service stations each modelled as a single server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average cost, we develop heuristic routing policies and demonstrate their superior performance in an extensive numerical study.",
author = "Argon, {N T} and L Ding and Glazebrook, {K D} and S Ziya",
year = "2009",
doi = "10.1017/S0269964809000138",
language = "English",
volume = "23",
pages = "175--203",
journal = "Probability in the Engineering and Informational Sciences",
issn = "1469-8951",
publisher = "Cambridge University Press",

}

RIS

TY - JOUR

T1 - Dynamic routing of customers with general delay costs

AU - Argon, N T

AU - Ding, L

AU - Glazebrook, K D

AU - Ziya, S

PY - 2009

Y1 - 2009

N2 - We consider a network of parallel service stations each modelled as a single server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average cost, we develop heuristic routing policies and demonstrate their superior performance in an extensive numerical study.

AB - We consider a network of parallel service stations each modelled as a single server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average cost, we develop heuristic routing policies and demonstrate their superior performance in an extensive numerical study.

U2 - 10.1017/S0269964809000138

DO - 10.1017/S0269964809000138

M3 - Journal article

VL - 23

SP - 175

EP - 203

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

SN - 1469-8951

ER -