Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference8 articles.
1. F. Baccelli and A. Makowski, Simple computable bounds for the fork-join queue,Proc. John Hopkins Conf. Info. Sciences (1985).
2. U.N. Bhat, Finite capacity assembly-like queues, Queueing Syst. Theor. and Appl. 1(1986)
3. F. Bonomi, private communication.
4. D. Gross and C.M. Harris,Fundamentals of Queueing Theory (Wiley, New York, 1974).
5. J.M. Harrison, Assembly-like queues, J. Appl. Prob. 10(1973)354.
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献