Lee's Notation

Posted in Operations and Supply Chain Terms, Total Reads: 3325

Definition: Lee's Notation

Kendall Lee’s notation is used in queuing theory as the standard system to describe and classify a queue model.


  • A – Arrival process
    • M - Poisson distribution; random arrival process
    • D – Degenerate distribution; Deterministic or fixed arrival rate
    • G – General distribution
    • E – Erlang distribution


  • S – Service time distribution
    • M – Exponential service time
    • D – Degenerate distribution; Deterministic or fixed service time
    • E – Erlang distribution


  • C – Number of servers
    • Can range from 1 to many


  • K – Capacity of the whole system, i.e., maximum number of customers allowed in queue plus those being serviced.
    • By default taken as infinity


  • N – Size of the population from where customers are coming.
    • By default taken as infinity


  • D – Queue discipline, i.e., the order in which the customers in queue are being served
    • FCFS – First come first serve; Default
    • LCFS – Last come first serve
    • SIRO – Service in random order
    • PS – Processor sharing
    • PNPN – Priority service


Example: M/M/1

This is a queue with poisson arrival process, exponential service time, one server, infinite system capacity, infinite calling population and FCFS order.

Hence, this concludes the definition of Lee's Notation along with its overview.


Browse the definition and meaning of more terms similar to Lee's Notation. The Management Dictionary covers over 7000 business concepts from 6 categories.

Search & Explore : Management Dictionary

Share this Page on:
Facebook ShareTweetShare on G+Share on Linkedin