Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

TOPIC: WAITING LINES:

QUEUING THEORY - is a mathematical approach to the analysis of waiting lines

* WAITING LINES are commonly found whenever customers arrive randomly for services

Queuing Goal - essentially minimize total costs.

BASIC CATEGORIES OF COST IN QUEUING:


1. Those associated with customers waiting for service
2. Those associated with service capacity costs
> Capacity Cost - are the costs of maintaining the ability to provide service

Queuing Analysis Goal - is to balance the cost of providing a level of service capacity with the cost of
customers waiting for service

SYSTEM CHARACTERISTICS:

1. Population Source
A. Infinite Source - Customer arrivals are unrestricted
B. Finite Source - The number of potential customer is limited
2. Number of Servers (Channels)
A. Single Channel (Single Channel, Single Phase / Single Channel Multiple Phase)
B. Multiple Channel (Multiple Channel Single Phase, Multiple Channel Multiple Phase)

3. Arrival and Service Patterns

4. Queue discipline (order of service) - refers to the order in which customers are processed.

MEASURES OF SYSTEM PERFORMANCE:

1. The average number of customers waiting, either in line or in the system


2. The average time customers wait, either in line or in the system
3. System utilization, which refers to the percentage of capacity and its related waiting line
4. The implied cost of a given level of capacity and its related waiting line
5. The probability that an arrival will have to wait for service
BASIC RELATIONSHIP

MODEL 1: SINGLE CHANNEL EXPONENTIAL SERVICE TIME

MODEL 2: SINGLE CHANNEL FINITE SERVICE


MODEL 3: MULTIPLE CHANNEL

TOTAL COST:

MAXIMUM WAITING LINE:

;
MODEL 4: MULTIPLE PRIORITIES
SAMPLE PROBLEMS:

1. BASIC RELATIONSHIP
2. MODEL 1: SINGLE CHANNEL, EXPONENTIAL SERVICE TIME

3. MODEL 2: SINGLE CHANNEL, FINITE SERVICE TIME


4. MODEL 3: MULTIPLE CHANNEL:

5. COST ANALYSIS
6. MODEL 4: MULTIPLE PRIORITIES
7. MAXIMUM LENGTH

You might also like