Artículos relacionados a The M/M/? Service System with Ranked Servers in Heavy...
The M/M/? Service System with Ranked Servers in Heavy Traffic: 231 (Lecture Notes in Economics and Mathematical Systems) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 14,95
EUR 7,95 gastos de envío desde Alemania a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 52,29
EUR 3,42 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para The M/M/? Service System with Ranked Servers in Heavy...
Imagen del vendedor
The M/ M/ (infinite) service system with ranked servers in heavy traffic. Lecture Notes in Economics and Mathematical Systems Vol. 231;
Publicado por
Berlin ; Heidelberg ; New York ; Tokyo : Springer, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Antiguo o usado
Broschiert
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 1291726
Gastos de envío:
EUR 7,95
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
The M/M/8service System With Ranked Servers in Heavy Traffic
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Antiguo o usado
Softcover
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: E-595-785
Gastos de envío:
EUR 22,50
De Francia a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Lecture Notes in Economics and Mathematical Systems, Volume 231: The M/M/[Infinity Symbol] Service System With Ranked Servers in Heavy Traffic
Publicado por
Springer-Verlag, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Antiguo o usado
Softcover
Librería: BookDepart, Shepherdstown, WV, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Softcover. Condición: Good. Softcover, volume 231; light fading, light shelf wear to exterior; date written on title page; good condition with clean text, firm binding. Nº de ref. del artículo: 49957
Cantidad disponible: 1 disponibles
Imagen de archivo
The M/M/?Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020160189
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
The M/M/Service System with Ranked Servers in Heavy Traffic (Paperback)
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Nuevo
Paperback
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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. We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783540133773
Cantidad disponible: 1 disponibles
Imagen de archivo
The M/M/?Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540133773_new
Gastos de envío:
EUR 13,80
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
The M/M/8Service System with Ranked Servers in Heavy Traffic
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540133773
Gastos de envío:
EUR 17,84
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 disponibles
Imagen de archivo
The M/M/?Service System with Ranked Servers in Heavy Traffic
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 144. Nº de ref. del artículo: 2658589189
Cantidad disponible: 4 disponibles
Imagen del vendedor
The M/M/infinite Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231, Band 231)
Librería: Leserstrahl (Preise inkl. MwSt.), Oldenbüttel, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Very Good. 1984. Ehemaliges Büchereiexemplar mit Stempel, Aufkleber, Seiten gebräunt, ---. nein. Nº de ref. del artículo: 112452
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen del vendedor
The M/M/¿Service System with Ranked Servers in Heavy Traffic
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 1984, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 9783540133773
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles