Dynamic control of a single-server system with abandonments

@article{Down2011DynamicCO,
  title={Dynamic control of a single-server system with abandonments},
  author={Douglas G. Down and Ger Koole and Mark E. Lewis},
  journal={Queueing Systems},
  year={2011},
  volume={67},
  pages={63-90}
}
In this paper, we discuss the dynamic server control in a two-class service system with abandonments. Two models are considered. In the first case, rewards are received upon service completion, and there are no abandonment costs (other than the lost opportunity to gain rewards). In the second, holding costs per customer per unit time are accrued, and each abandonment involves a fixed cost. Both cases are considered under the discounted or average reward/cost criterion. These are extensions of… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Ordonnancement stochastique avec impatience

VIEW 10 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes

  • Queueing Syst.
  • 2013
VIEW 4 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

Scheduling a Rescue

VIEW 1 EXCERPT
CITES BACKGROUND

A c-mu Rule for Two-Tiered Parallel Servers

  • IEEE Transactions on Automatic Control
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

A diffusion approximation for reneging.Queueing Systems cμ-rule revisited. Advances in Applied 1, 12 ers: Tutorial, review and

A. R. Ward, P. W. Glynn
  • ohn Wiley and Sons, Inc., New rete time Markov decision
  • 2009

Dynamic scheduling of an 2009.2

S. Ghamami, A. Ward
  • 2009

Dynamic scheduling of an N - system with reneging

O. Hernández-Lerma, T. Prieto-Rumeau
  • 2009

Interchange arguments for classical scheduli Control Letters

P. Nain
  • 12:177–184
  • 1989