9783540133773 - The M/M/? Service System with Ranked Servers in Heavy Traffic: 231 (Lecture Notes in Economics and Mathematical Systems, 231) de Newell, G. F. (14 resultados)

Softcover. Condición: Très bon. Ancien livre de bibliothèque. Edition 1984. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1984. Ammareal gives back up to 15% of this item's net price to charity organizations.

Broschiert. Condición: Gut. X, 126 S. : graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.). Schnitt und Einband sind etwas staubschmutzig; Einbandkanten sind leicht bestossen; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Sprache: Englisch Gewicht in Gramm: 250.

Condición: New. In.

PF. Condición: New.

Condición: New. pp. 144.

Taschenbuch. Condición: Very Good. 1984. Ehemaliges Büchereiexemplar mit Stempel, Aufkleber, Seiten gebräunt, ---. nein.

Paperback. Condición: Brand New. 144 pages. 9.61x6.69x0.33 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant.

Taschenbuch. Condición: Neu. The M/M/¿Service System with Ranked Servers in Heavy Traffic | G. F. Newell | Taschenbuch | Lecture Notes in Economics and Mathematical Systems | xii | Englisch | 1984 | Springer | EAN 9783540133773 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant. 144 pp. Englisch.

Condición: New. Print on Demand pp. 144 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 144.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowes.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 144 pp. Englisch.