9783540133773 - the m/m/? service system with ranked servers in heavy traffic: 231 di newell, g. f. (15 risultati)
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. K 1984
- Brossura
Da: Ammareal, Morangis, , FranciaAmmareal
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 3,50
EUR 16,50 spedizioneSpedito da Francia a U.S.A.Quantità: 1 disponibili
Softcover. Condizione: 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 organizati…ons.
Lingua: Inglese
Editore: Berlin ; Heidelberg ; New York ; Tokyo : Springer 1984
- Brossura
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, , Germaniabooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 14,95
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Broschiert. Condizione: 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 an…sonsten ordentlich und dem Alter entsprechend gut. Sprache: Englisch Gewicht in Gramm: 250.
- Brossura
Da: BookDepart, Shepherdstown, WV, U.S.A.BookDepart
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 24,45
EUR 7,36 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Softcover. Condizione: Good. Softcover, volume 231; light fading, light shelf wear to exterior; date written on title page; good condition with clean text, firm binding.
- Brossura
Da: Chiron Media, Wallingford, , Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 56,33
EUR 17,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
PF. Condizione: New.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,28
EUR 13,80 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 76,37
EUR 3,48 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 144.
- Brossura
Da: Leserstrahl (Preise inkl. MwSt.), Oldenbüttel, , GermaniaLeserstrahl (Preise inkl. MwSt.)
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 9,14
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Very Good. 1984. Ehemaliges Büchereiexemplar mit Stempel, Aufkleber, Seiten gebräunt, ---. nein.
- Brossura
Da: Revaluation Books, Exeter, , Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 77,42
EUR 11,52 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 144 pages. 9.61x6.69x0.33 inches. In Stock.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 61,31 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: 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, juerg…en[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 1984 1984
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, , Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 77,07
EUR 7,49 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: 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.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 76,08
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 144.
- Brossura
- Print on Demand
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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 cus…tomer 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.
