Abstract
In this chapter we investigate the two-stage tandem queue with coupled processors, which has been suggested as a model for a reservation mechanism in Sect. 2.4. It is assumed that jobs arrive at the first station according to a Poisson process and require service at both stations before leaving the system. The amounts of work that a job requires at each of the stations are independent, exponentially distributed random variables. When both stations are nonempty, the total service capacity is shared between the stations according to fixed proportions. When one of the stations becomes empty, the total service capacity is given to the nonempty station.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). A Tandem Queue with Coupled Processors. In: Multiaccess, Reservations & Queues. Philips Research Book Series, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69317-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-69317-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69316-1
Online ISBN: 978-3-540-69317-8
eBook Packages: Computer ScienceComputer Science (R0)