Abstract
The structural and computational simplicity of classical product form queueing networks in continuous time (see e.g.: 75, 4, 69, 50) relies on the property that independently moving customers which are independently served with probability one do not jump at the same time instant. From about 1990 on a sequence of papers appeared which considered explicitly networks where servicing is done for customer batches and where customers are forwarded into and through the network in batches. Before that, similar problems were mostly dealt with via simulation or using approximations. Only special mini networks were solved explicitly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). General Networks with Batch Movements and Batch Services. In: Queueing Networks with Discrete Time Scale. Lecture Notes in Computer Science, vol 2046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44592-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-44592-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42357-7
Online ISBN: 978-3-540-44592-0
eBook Packages: Springer Book Archive