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

Gittins‐index heuristics for research planning

Author

Listed:
  • K. D. Glazebrook
  • R. W. Owen

Abstract

The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins‐index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • K. D. Glazebrook & R. W. Owen, 1995. "Gittins‐index heuristics for research planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1041-1062, October.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:7:p:1041-1062
    DOI: 10.1002/1520-6750(199510)42:73.0.CO;2-E
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199510)42:73.0.CO;2-E
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199510)42:73.0.CO;2-E?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. I. Benkherouf & K. D. Glazebrook & R. W. Owen, 1994. "Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment," Operations Research, INFORMS, vol. 42(6), pages 1087-1099, December.
    2. Glazebrook, K. D. & Greatrix, S., 1993. "On scheduling influential stochastic tasks on a single machine," European Journal of Operational Research, Elsevier, vol. 70(3), pages 405-424, November.
    3. Meilijson, Isaac & Weiss, Gideon, 1977. "Multiple feedback at a single-server station," Stochastic Processes and their Applications, Elsevier, vol. 5(2), pages 195-205, May.
    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. K. D. Glazebrook, 1995. "A suboptimality bound for permutation policies in single machine stochastic scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 993-1005, September.

    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.
    1. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Seyed M. R. Iravani & John A. Buzacott & Morton J. M. Posner, 2003. "Operations and Shipment Scheduling of a Batch on a Felxible Machine," Operations Research, INFORMS, vol. 51(4), pages 585-601, August.
    3. José Niño-Mora, 2000. "Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs," Economics Working Papers 514, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Malekipirbazari, Milad & Çavuş, Özlem, 2024. "Index policy for multiarmed bandit problem with dynamic risk measures," European Journal of Operational Research, Elsevier, vol. 312(2), pages 627-640.
    5. Esther Frostig & Gideon Weiss, 2016. "Four proofs of Gittins’ multiarmed bandit theorem," Annals of Operations Research, Springer, vol. 241(1), pages 127-165, June.
    6. José Niño-Mora, 2023. "Markovian Restless Bandits and Index Policies: A Review," Mathematics, MDPI, vol. 11(7), pages 1-27, March.
    7. Urtzi Ayesta & Peter Jacko & Vladimir Novak, 2017. "Scheduling of multi-class multi-server queueing systems with abandonments," Journal of Scheduling, Springer, vol. 20(2), pages 129-145, April.

    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:42:y:1995:i:7:p:1041-1062. 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.