Concepedia

The <i>c</i>μ rule revisited

C. Buyukkoc, Pravin Varaiya, Jean Walrand

Advances in Applied Probability · 1985 · 239 citations · 4 references

DOIFull text

Open access

Concepts

Abstract

The cμ rule is optimal for arbitrary arrival processes provided that the service times are geometric and the service discipline is preemptive.

References

4

Extensions of the multiarmed bandit problem: The discounted case

Pravin Varaiya, Jean Walrand, C. Buyukkoc · IEEE Transactions on Automatic Control · 1985 · 290 citations

, , +14

Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal

John S. Baras, A. J. Dorsey, Armand M. Makowski · Advances in Applied Probability · 1985 · 87 citations

, , +16

Extension of the multi-armed bandit problem

Pravin Varaiya, Jean Walrand, C. Buyukkoc · 1983 · 35 citations

, , +12

Two competing queues with linear costs: the μ<i>c</i>-rule is often optimal

John S. Baras, A. J. Dorsey, Armand M. Makowski · Advances in Applied Probability · 1984 · 11 citations

, , +16