Production and Operations Analysis, Seventh Edition
Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
bartleby

Concept explainers

Question
Book Icon
Chapter 9.9, Problem 23P

a.

Summary Introduction

Interpretation: The expected numbers of jobs which are in queue with steady status along with number of jobs in the system have to be computed.

Concept Introduction:

FCFS basis- Normally, there is a process in attending the jobs or, customers. FCFS basis means attending a job or customer on First come first serve basis. In other words, the job/customer which/who comes first is attended first.

B.

Summary Introduction

Interpretation: The expected flow time along with the time spent in a queue with steady status have to be computed.

Concept Introduction:

Flow time: The time spent in a business process right from beginning to end is called the flow time. It is also called total processing time.

C.

Summary Introduction

Interpretation: The probability about the system being empty needs to be computed.

Concept Introduction:

Probability: Probability is the chance of an event occurring. Number of favorable outcomes must be divided by total number of possible outcomes to get the probability factor.

D.

Summary Introduction

Interpretation: The probability about the queue being empty needs to be computed.

Concept Introduction:

Probability: Probability is the chance of an event occurring. Number of favorable outcomes must be divided by total number of possible outcomes to get the probability factor.

e.

Summary Introduction

Interpretation: The probability about the flow time exceeding 10 minutes needs to be computed.

Concept Introduction:

Probability: Probability is the chance of an event occurring. Number of favorable outcomes must be divided by total number of possible outcomes to get the probability factor.

Blurred answer
Students have asked these similar questions
A computer system queues up batch jobs and processes them on an FCFS basis.Between 2 and 5 P.M., jobs arrive at an average rate of 30 per hour and require anaverage of 1.2 minutes of computer time. Assume the arrival process is Poissonand the processing times are exponentially distributed.b. What are the expected flow time and the time in the queue in the steady state?
A computer system queues up batch jobs and processes them on an FCFS basis.Between 2 and 5 P.M., jobs arrive at an average rate of 30 per hour and require anaverage of 1.2 minutes of computer time. Assume the arrival process is Poissonand the processing times are exponentially distributed.a. What is the expected number of jobs in the system and in the queue in thesteady state?
A computer system queues up batch jobs and processes them on an FCFS basis.Between 2 and 5 P.M., jobs arrive at an average rate of 30 per hour and require anaverage of 1.2 minutes of computer time. Assume the arrival process is Poissonand the processing times are exponentially distributed.c. What is the probability that the system is empty?