IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v55y2008i2p142-155.html
   My bibliography  Save this article

Dynamic policies for uncertain time‐critical tasking problems

Author

Listed:
  • Kevin D. Glazebrook
  • Emma L. Punton

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. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Suggested Citation

  • Kevin D. Glazebrook & Emma L. Punton, 2008. "Dynamic policies for uncertain time‐critical tasking problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(2), pages 142-155, March.
    • Handle: RePEc:wly:navres:v:55:y:2008:i:2:p:142-155
    DOI: 10.1002/nav.20272
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20272
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20272?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. K.D. Glazebrook & E.L. Punton, 2005. "Fixed-time schedules for the processing of jobs when service completions are not observable," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(1), pages 77-97, September.
    2. S. D. Deshmukh & Suresh Jain, 1977. "Capacity Design and Service Quality Control in a Queuing System," Operations Research, INFORMS, vol. 25(4), pages 651-661, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Terry James & Kevin Glazebrook & Kyle Lin, 2016. "Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 251-264, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:55:y:2008:i:2:p:142-155. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.