08.01.2017 Views

3e2a1b56-dafb-454d-87ad-86adea3e7b86

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

334<br />

Part Three<br />

Planning and control<br />

Variability<br />

The concept of variability is central to understanding the behaviour of queues. If there were<br />

no variability there would be no need for queues to occur because the capacity of a process<br />

could be relatively easily adjusted to match demand. For example, suppose one member of<br />

staff (a server) serves at a bank counter customers who always arrive exactly every five minutes<br />

(i.e. 12 per hour). Also suppose that every customer takes exactly five minutes to be served,<br />

then because,<br />

(a) the arrival rate is ≤ processing rate, and<br />

(b) there is no variation<br />

no customer need ever wait because the next customer will arrive when, or before, the<br />

previous customer. That is, WIP q = 0.<br />

Also, in this case, the server is working all the time, again because exactly as one customer<br />

leaves the next one is arriving. That is, u = 1.<br />

Even with more than one server, the same may apply. For example, if the arrival time at<br />

the counter is five minutes (12 per hour) and the processing time for each customer is now<br />

always exactly 10 minutes, the counter would need two servers, and because,<br />

(a) arrival rate is ≤ processing rate m, and<br />

(b) there is no variation<br />

again, WIP q = 0, and u = 1.<br />

Of course, it is convenient (but unusual) if arrival rate/processing rate = a whole number.<br />

When this is not the case (for this simple example with no variation),<br />

Utilization = processing rate/(arrival rate multiplied by m)<br />

For example, if arrival rate, r a = 5 minutes<br />

processing rate, r e = 8 minutes<br />

number of servers, m = 2<br />

then, utilization, u = 8 / (5 × 2) = 0.8 or 80%<br />

Incorporating variability<br />

The previous examples were not realistic because the assumption of no variation in arrival or<br />

processing times very rarely occurs. We can calculate the average or mean arrival and process<br />

times but we also need to take into account the variation around these means. To do that we<br />

need to use a probability distribution. Figure S11.1 contrasts two processes with different<br />

arrival distributions. The units arriving are shown as people, but they could be jobs arriving<br />

at a machine, trucks needing servicing, or any other uncertain event. The top example shows<br />

low variation in arrival time where customers arrive in a relatively predictable manner. The<br />

bottom example has the same average number of customer arriving but this time they arrive<br />

unpredictably with sometimes long gaps between arrivals and at other times two or three<br />

customers arriving close together. Of course, we could do a similar analysis to describe processing<br />

times. Again, some would have low variation, some higher variation and others be<br />

somewhere in between.<br />

In Figure S11.1 high arrival variation has a distribution with a wider spread (called<br />

‘dispersion’) than the distribution describing lower variability. Statistically the usual measure<br />

for indicating the spread of a distribution is its standard deviation, σ. But variation does not<br />

only depend on standard deviation. For example, a distribution of arrival times may have<br />

a standard deviation of 2 minutes. This could indicate very little variation when the average<br />

arrival time is 60 minutes. But it would mean a very high degree of variation when the

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!