Approximate Behavior of Tandem Queues. Lecture notes in Economics and Mathematical Systems, 171, Operations Research

Newell, G. F.

ISBN 10: 3540095527 / ISBN 13: 9783540095521

Verlag: Springer-Verlag, 1979

Beschreibung

410 pp., Paperback, hand stamp to front cover, else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Bestandsnummer des Verkäufers ZB1067148

Bibliografische Details

• Titel: Approximate Behavior of Tandem Queues. Lecture notes in Economics and Mathematical Systems, 171, Operations Research
• Verlag: Springer-Verlag
• Erscheinungsjahr: 1979
• Sprache: Englisch
• ISBN-10: 3540095527
• ISBN-13: 9783540095521
• Einband: Softcover
• Zustand: Very Good

Über diesen Titel

Inhaltsangabe

The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the storages and the queue lengths are typically large compared with 1. One can disregard the fact that the customer counts must be integer valued and treat the queue as if it were a (stochastic) continuous fluid. In these approximations, it is not necessary to describe the detailed probability distribution of service times; it suffices simply to specify the rate of service and the variance rate (the variance of the number served per unit time). Specifically, customers are considered to originate from an infinite reservoir. They first pass through a server with service rate ~O' vari­ ance rate ~O' into a storage of finite capacity c . They then pass l through a server with service rate ~l' variance rate ~l' into a storage of capacity c ' etc., until finally, after passing through an nth server, 2 they go into an infinite reservoir (disappear). If any jth storage become , n , the service at the j-lth server is interrupted full j = 1, 2, and, of course, if a jth storage becomes empty the jth server is inter­ rupted; otherwise, services work at their maximum rate.