Algorithmic and approzimation analyses of the split and match queue-Reference-Cited by-同舟云学术

Algorithmic and approzimation analyses of the split and match queue

Published:1985-01 Issue:3 Volume:1 Page:433-456
ISSN:0882-0287
Container-title:Communications in Statistics. Stochastic Models
language:en
Short-container-title:Communications in Statistics. Stochastic Models

Author:

Rao B. M.,Posner M. J. M.

Publisher

Informa UK Limited

Subject

Modeling and Simulation

Link

http://www.tandfonline.com/doi/pdf/10.1080/15326348508807022

Reference9 articles.

1. Two Parallel Queues Created by Arrivals with Two Demands I

2. George, L. L. 1973. “Diffusion Approximation for Two Channel Poisson - Exponential Service Systems with Dependence”. Berkeley: University of California. Ph.D Thesis

3. Mandelbaum, M. and Thesis, M. S. 1968. “Queueing with Splitting and Matching”. Israel: Technion - Israel Institute of Technology.

4. Neuts, M. F. 1981. “Matrix-Geometric Solutions in Stochastic Models -An Algorithmic Approach”. Baltimore: The Johns Hopkins University Press.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis of Fork/Join and Related Queueing Systems;ACM Computing Surveys;2015-01-08

2. Approximate analysis of finite fork/join queueing networks;Computers & Industrial Engineering;1997-09

3. On queue length moments in fork and join queuing networks with general service times;Computer Performance Evaluation Modelling Techniques and Tools;1997

4. Assembly Systems;Performance Analysis of Manufacturing Systems;1997

5. On the Production Rate of a Merge Production System;International Journal of Quality & Reliability Management;1994-11