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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: December 2003/Final version received: March 2004
Rights and permissions
About this article
Cite this article
Glazebrook, K. Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case. Math Meth Oper Res 61, 147–169 (2005). https://doi.org/10.1007/s001860400386
Issue Date:
DOI: https://doi.org/10.1007/s001860400386