June 2006
Beginner
793 pages
20h 59m
English
Kendall’s Notation is a system of notation according to which the various characteristics of a queuing model are identified.
Kendall (Kendall, 1951) has introduced a set of notations which have become standard in the literature of queuing models. A general queuing system is denoted by (a/b/c): (d/e) where
| a | = | probability distribution of the interarrival time. |
| b | = | probability distribution of the service time. |
| c | = | number of servers in the system. |
| d | = | maximum number of customers allowed in the system. |
| e | = | queue discipline |
In addition, the size of the population is important for certain types of queuing problem although not explicitly mentioned in the Kendall’s notation. Traditionally, the exponential distribution ...
Read now
Unlock full access