IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v61y2005i1p147-169.html
   My bibliography  Save this article

Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case

Author

Listed:
  • Kevin D. Glazebrook

Abstract

It has long been recognised that situations in which some key resource or service is to be allocated among jobs or customers competing for it are often subject to a range of uncertainties. Key amongst these concern the reliability of service itself. When the service being delivered to a job is disrupted by some failure of the service mechanism, it is reasonable to suppose that effort may subsequently be required to restore that job to its position before the breakdown occurred. We develop optimal index policies for service allocation for a range of semi-Markovian models which capture this key feature in a range of ways. Copyright Springer-Verlag 2005

Suggested Citation

  • Kevin D. Glazebrook, 2005. "Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(1), pages 147-169, March.
    • Handle: RePEc:spr:mathme:v:61:y:2005:i:1:p:147-169
    DOI: 10.1007/s001860400386
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400386
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400386?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2021. "Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns," Annals of Operations Research, Springer, vol. 298(1), pages 43-64, March.

    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:spr:mathme:v:61:y:2005:i:1:p:147-169. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.