Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Globally Optimal Multi-agent Reinforcement Learning Parameters in Distributed Task Assignment
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Process Algebraic Non-product-forms
Electronic Notes in Theoretical Computer Science (ENTCS)
Queues in tandem with customer deadlines and retrials
Queueing Systems: Theory and Applications
| Hi-index | 0.01 |
(This article originally appeared in Management Science, November 1963, Volume 10, Number 1, pp. 131-142, published by The Institute of Management Sciences.) The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like "networks of waiting lines," where the mean arrival rate of customers depends almost arbitrarily upon the number already present, and the mean service rate at each service center depends almost arbitrarily upon the queue length there. This extension of the author's earlier work is motivated by the observation that real production systems are usually subject to influences which make for increased stability by tending, as the amount of work-in-process grows, to reduce the rate at which new work is injected or to increase the rate at which processing takes place.