Version:11/27/2007ISyE 3232H. Ayhan and J. G. DaiDue: Section B on Wednesday, 5th of December, Section C on Tuesday 4th of December.Homework 121. Consider a call center that is staffed by K agents with three phone lines. Call arrivals followa Poisson process with rate 1 per minute. An arrival call that finds all lines busy is lost. Callprocessing times are exponentially distributed with mean 2 minutes.(a) Find the throughput and average waiting time when K = 1.(b) Find the throughput and average waiting time when K = 2.(c) Find the throughput and average waiting time when K = 3.2. Consider a service system with a single server whose service time is exponentially distributedwith rateμand infinite capacity. The arrivals come to the system following a Poisson processof rateλbut an arrival findingipeople in the system will enter the system with probability1/(i+ 1). For example at the time of your arrival if there are 2 people in the system you willenter with probability 1/3.
This is the end of the preview.
access the rest of the document.