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

Kevin D. Glazebrook

Mathematical Methods of Operations Research, 2005, vol. 61, issue 1, 147-169

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

Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860400386 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:61:y:2005:i:1:p:147-169

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860400386

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().