Home > Research > Publications & Outputs > Dynamic policies for uncertain time-critical ta...

Research

Electronic data

Links

Text available via DOI:

View graph of relations

Dynamic policies for uncertain time-critical tasking problems

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

Dynamic policies for uncertain time-critical tasking problems. / Glazebrook, K D; Punton, E L.
In: Naval Research Logistics, Vol. 55, No. 2, 2008, p. 142-155.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Glazebrook, KD & Punton, EL 2008, 'Dynamic policies for uncertain time-critical tasking problems', Naval Research Logistics, vol. 55, no. 2, pp. 142-155. https://doi.org/10.1002/nav.20272

APA

Glazebrook, K. D., & Punton, E. L. (2008). Dynamic policies for uncertain time-critical tasking problems. Naval Research Logistics, 55(2), 142-155. https://doi.org/10.1002/nav.20272

Vancouver

Glazebrook KD, Punton EL. Dynamic policies for uncertain time-critical tasking problems. Naval Research Logistics. 2008;55(2):142-155. doi: 10.1002/nav.20272

Author

Glazebrook, K D ; Punton, E L. / Dynamic policies for uncertain time-critical tasking problems. In: Naval Research Logistics. 2008 ; Vol. 55, No. 2. pp. 142-155.

Bibtex

@article{657feb5c8112413f8aee5bb3d036f67a,
title = "Dynamic policies for uncertain time-critical tasking problems",
abstract = "A recent paper by Gaver et al. 6 argued the importance of studying service control problems in which the usual assumptions (i) that tasks will wait indefinitely for service and (ii) that successful service completions can be observed instantaneously are relaxed. Military and other applications were cited. They proposed a model in which arriving tasks are available for service for a period whose duration is unknown to the system's controller. The allocation of a large amount of processing to a task may make more likely its own successful completion but may also result in the loss of many unserved tasks from the system. Gaver et al. 6 called for the design of dynamic policies for the allocation of service which maximizes the rate of successful task completions achieved, or which come close to doing so. This is the theme of the paper. We utilize dynamic programming policy improvement approaches to design heuristic dynamic policies for service allocation which may be easily computed. In all cases studied, these policies achieve throughputs close to optimal. {\textcopyright} 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008",
author = "Glazebrook, {K D} and Punton, {E L}",
year = "2008",
doi = "10.1002/nav.20272",
language = "English",
volume = "55",
pages = "142--155",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - Dynamic policies for uncertain time-critical tasking problems

AU - Glazebrook, K D

AU - Punton, E L

PY - 2008

Y1 - 2008

N2 - A recent paper by Gaver et al. 6 argued the importance of studying service control problems in which the usual assumptions (i) that tasks will wait indefinitely for service and (ii) that successful service completions can be observed instantaneously are relaxed. Military and other applications were cited. They proposed a model in which arriving tasks are available for service for a period whose duration is unknown to the system's controller. The allocation of a large amount of processing to a task may make more likely its own successful completion but may also result in the loss of many unserved tasks from the system. Gaver et al. 6 called for the design of dynamic policies for the allocation of service which maximizes the rate of successful task completions achieved, or which come close to doing so. This is the theme of the paper. We utilize dynamic programming policy improvement approaches to design heuristic dynamic policies for service allocation which may be easily computed. In all cases studied, these policies achieve throughputs close to optimal. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

AB - A recent paper by Gaver et al. 6 argued the importance of studying service control problems in which the usual assumptions (i) that tasks will wait indefinitely for service and (ii) that successful service completions can be observed instantaneously are relaxed. Military and other applications were cited. They proposed a model in which arriving tasks are available for service for a period whose duration is unknown to the system's controller. The allocation of a large amount of processing to a task may make more likely its own successful completion but may also result in the loss of many unserved tasks from the system. Gaver et al. 6 called for the design of dynamic policies for the allocation of service which maximizes the rate of successful task completions achieved, or which come close to doing so. This is the theme of the paper. We utilize dynamic programming policy improvement approaches to design heuristic dynamic policies for service allocation which may be easily computed. In all cases studied, these policies achieve throughputs close to optimal. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

U2 - 10.1002/nav.20272

DO - 10.1002/nav.20272

M3 - Journal article

VL - 55

SP - 142

EP - 155

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 2

ER -