Chapter 11: Process Analysis and Resource Utilization

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/18

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

19 Terms

1
New cards

Utilization

The fraction of time a workstation or individual is busy over the long run

2
New cards
<p>H</p>

H

Two ways of computing resource utilization:

  1. Based on proportion of available resources being used

  2. Based on the ratio of demand rate to effective service capacity based on service rate and number of servers

3
New cards

Throughput

The number of units or tasks that are completed per unit time from a process

4
New cards

Bottleneck

The work activity that effectively limits the throughput of the entire process

5
New cards

Flow time (cycle time)

The average time it takes to complete one cycle of a process

6
New cards

Little’s Law

A simple equation that explains the relationship among flow time (T), throughput (R), and work-in-process (WIP)

<p>A simple equation that explains the relationship among flow time (T), throughput (R), and work-in-process (WIP)</p>
7
New cards

Queue

A waiting line

8
New cards

True

T or F: Queueing models help managers understand key performance measures such as waiting times, queue lengths, and machine or server idle times so that they can manage resources more effectively and provide better customer satisfaction.

9
New cards

Queueing system

It consists of customers that arrive for service, one or more servers that provide the service, and a queue (waiting line) of entities that wait for service if the server is busy

10
New cards
  1. One or more parallel servers fed by a single queue

  2. Several parallel servers fed by their own queues

  3. A combination of several queues in series

Three (3) common queueing configurations:

11
New cards

Queueing theory

Analytical study of waiting lines

12
New cards
term image

A simple model for the total cost of waiting for service (TCw) as a function of the number of servers as well as the average number of customers in the system:

where: 

Cw = the waiting cost per hour per customer

Cs = the hourly cost associated with each server

L = average number of customers in the system(queue and in service)

k = number of servers

13
New cards

Fixed-time simulation model

A simulation model that increments time in fixed intervals

14
New cards

Theory of Constraints (TOC)

A set of principles that focuses on increasing total process throughput by maximizing the utilization of all bottleneck work activities and workstations

15
New cards

Physical constraint

Associated with the capacity of a resource such as a machine, employee, or workstation

16
New cards

Non-bottleneck work activity

One in which idle capacity exists

17
New cards

True

T or F: The TOC focuses on identifying constraints, managing bottleneck and non-bottleneck work activities carefully, linking them to the markets and financial performance metrics to ensure an appropriate product mix, and scheduling the non-bottleneck resources to enhance throughput.

18
New cards
  1. The probability that the system is empty (i.e., the probability of 0 units in both the queue and in service).

  2. The average number of units waiting for service in the queue.

  3. The average number of units in the system (queue and in service).

  4. The average time a unit spends waiting for service (time in queue).

  5. The average time a unit spends in the system (waiting time plus service time).

  6. The probability that an arriving unit has to wait for service.

  7. The probability of n units in the system (queue and in service).

Typical performance measures that are computed using queueing theory:

19
New cards

True

T or F: Simulation models are also better equipped to capture the dynamic behavior of queues over time.