Exhibit 13.1
The following questions are based on the output below.
A store currently operates its service system with 1 operator. Arrivals follow a Poisson distribution and service times are exponentially distributed. The following spreadsheet has been developed for the system.
-An arrival process is memoryless if
A) the time until the next arrival depends on the time elapsed since the last arrival.
B) the time until the next arrival is based on the time elapsed since the last arrival.
C) the time until the next arrival does not depend on the time elapsed since the last arrival.
D) the time until the next arrival is based on the arrival rate.

Question

Exhibit 13.1
The following questions are based on the output below.
A store currently operates its service system with 1 operator. Arrivals follow a Poisson distribution and service times are exponentially distributed. The following spreadsheet has been developed for the system. 
-An arrival process is memoryless if
A) the time until the next arrival depends on the time elapsed since the last arrival. 
B) the time until the next arrival is based on the time elapsed since the last arrival. 
C) the time until the next arrival does not depend on the time elapsed since the last arrival. 
D) the time until the next arrival is based on the arrival rate.

Quizplus · Accepted Answer

A Poisson arrival process is memoryless, meaning that the time until the next arrival does not depend on the time elapsed since the last arrival. This is a fundamental property of the Poisson distribution.

Exhibit 13.1 The Following Questions Are Based on the Output Below