{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 11

# Lecture 11 - The arrival Î and service rates Î¼ must be in...

This preview shows pages 1–3. Sign up to view the full content.

Queuing What is queuing theory? The mathematical approach to the analysis of lines Useful in planning and analysis of service capacity Goal of queuing -- minimize total cost - costs associated with customers waiting in line for service and those associated with capacity System Characteristics 1) Population source o Infinite source o Finite source 1) Number of servers (channels) o Single o Multiple 2) Arrival and service patterns o Probability distribution (exponential, Poisson, etc) 3) Queue discipline (order of service) o First-come-first-served

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Queuing Models: Infinite Sources Assumptions: o Poisson arrival rate o System operates under steady state (average arrival and service rates are stable) Important note
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: : The arrival ( Î» ) and service rates ( Î¼ ) must be in the same units Four Basic Models 1) Single channel, exponential service time 2) Single channel, constant service time 3) Multiple channel, exponential service time 4) Multiple priority service, exponential service time Finite Source (2) Appropriate for cases in which the calling population is limited to a relatively small number of potential calls (3) Example -- one person may be responsible for handling breakdown on 15 machines (4) The mathematics of finite-source model can be complex, analysts often use finite queuing tables in conjunction with simple formulas to analyze these systems...
View Full Document

{[ snackBarMessage ]}

### Page1 / 3

Lecture 11 - The arrival Î and service rates Î¼ must be in...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online