| Term | Definition |
| Queing Theory | Mathematical approach to the analysis of waiting lines. |
| Waiting and Service Costs | What is the goal to minimize |
| Infinite (unlimited) and Finite (Limited) | The size of the population is either |
| Arrival Rate and Poissan | What is Lambda and how is it distributed? |
| Reasons managers are concerned | Cost to provide waiting source, Loss of business, Customers leaving/refusing, Loss of goodwill |
| Total Cost | Waiting Cost + Service Capacity Cost |
| Service Capacity Costs | Costs of maintaining the ability to provide service |
| Main Characteristics of Queing System | Population Source, Number of Servers, Arrival Patterns, Queue Discipline |
| Infinite Source | A component of population source, The number of potential customers exceed system capacity. |
| Finite Source | Component of population source, numbers of potential customers are limited. |
| Number of Channels (Servers) | Systems can be multiple or single |
| Arrival/Service Pattern | Customers can arrive randomly or scheduled. |
| Random Arrival Times | Poisson distributed, random or constant. |
| Service Times | Can be random or constant |
| Random Service Times | Distributed according to negative exponential distribution |
| Queue Discipline | The order in which customers are processed, Use FIFO, i.e. emergency room. |
| Patient | Customers enter the waiting line and remain until served |
| Reneging | Waiting customers grow impatient and leave the line |
| Jockeying | Customers may switch to another line |
| Balking | Upon arrivingm they think line is too long and don't enter at all |
| 5 Measures to Evaluate Service Systems | Avg. # customers waiting in line, Avg. time customers wait, System Utilization, Implied Cost, Probability |
| Commone queuing models | Single server/exponential service time, Single server/constant service time, Multiple channel/exponential service time |
| Lq | Avg. # customers in queue |
| r | Avg. # customers being served |
| Ls | Avg. # customers in the system |