6 results
Servers in tandem with communication and manufacturing blocking
- Part of
-
- Journal:
- Journal of Applied Probability / Volume 30 / Issue 2 / June 1993
- Published online by Cambridge University Press:
- 14 July 2016, pp. 429-437
- Print publication:
- June 1993
-
- Article
- Export citation
Next-fit bin packing with random piece sizes
-
- Journal:
- Journal of Applied Probability / Volume 26 / Issue 3 / September 1989
- Published online by Cambridge University Press:
- 14 July 2016, pp. 503-511
- Print publication:
- September 1989
-
- Article
- Export citation
Response times in M/M/1 time-sharing schemes with limited number of service positions
-
- Journal:
- Journal of Applied Probability / Volume 25 / Issue 3 / September 1988
- Published online by Cambridge University Press:
- 14 July 2016, pp. 579-595
- Print publication:
- September 1988
-
- Article
- Export citation
Server sharing with a limited number of service positions and symmetric queues
-
- Journal:
- Journal of Applied Probability / Volume 24 / Issue 4 / December 1987
- Published online by Cambridge University Press:
- 14 July 2016, pp. 990-1000
- Print publication:
- December 1987
-
- Article
- Export citation
The shortest queue problem
-
- Journal:
- Journal of Applied Probability / Volume 22 / Issue 4 / December 1985
- Published online by Cambridge University Press:
- 14 July 2016, pp. 865-878
- Print publication:
- December 1985
-
- Article
- Export citation
A new heavy-traffic limit theorem for many-server queues
-
- Journal:
- Advances in Applied Probability / Volume 12 / Issue 2 / June 1980
- Published online by Cambridge University Press:
- 01 July 2016, p. 295
- Print publication:
- June 1980
-
- Article
- Export citation