Exhibit 13.1 The Following Questions Are Based on the Output Below

question 30

Multiple Choice

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.

---

Definitions:

Shop Floor Dispatching

The process of scheduling and controlling work and workloads on the manufacturing or production floor in real-time.

Time Available

The total amount of time that can be utilized for a specific purpose or task, often factoring in operational hours and capacity constraints.

Minimizing Completion Time

A scheduling objective aimed at reducing the total time taken to complete a set of tasks or projects.