Question

In: Economics

Question 1. Consider a queuing system with a single queue and two servers in series. How...

Question 1. Consider a queuing system with a single queue and two servers in series.

How many statements are true?     (A) 0   (B) 1   (C) 2   (D) 3   (E) 4

Statement 1. Johnson’s rule is a sequencing rule that generates a schedule to minimize the total processing time.

Statement 2. Johnson’s rule concept is to schedule jobs with smaller times on first server early in the schedule.

Statement 3. A Gantt chart is a time plot of a schedule.

Statement 4. Flow of the first job in a schedule is the time of completion of the project.

Part 2.  

Question 2. Consider a queuing system with a single queue and a single server.

How many statements are true?     (A) 0   (B) 1   (C) 2   (D) 3   (E) 4

Statement 1. The MPT rule minimizes the total flow of a schedule.

Statement 2. The flow time of a job in a schedule equals the queue time plus the processing time.

Statement 3. The flow time of a schedule will always be greater than the processing time of a schedule.

Statement 4. The queue time of a job in a schedule is the flow of the preceding job.

Solutions

Expert Solution

Answered both the question for you, please put a like if you like the solution:)


Related Solutions

A queuing system with a Poisson arrival rate and exponential service time has a single queue,...
A queuing system with a Poisson arrival rate and exponential service time has a single queue, two servers, an average arrival rate of 60 customers per hour, and an average service time of 1.5 minutes per customer. Answer the following questions. Show ALL formulas and calculations used in your response. The manager is thinking of implementing additional queues to avoid an overloaded system. What is the minimum number of additional queues required? Explain. How many additional servers are required to...
A queuing system with a Poisson arrival rate and exponential service time has a single queue,...
A queuing system with a Poisson arrival rate and exponential service time has a single queue, two servers, an average arrival rate of 60 customers per hour, and an average service time of 1.5 minutes per customer. The manager is thinking of implementing additional queues to avoid an overloaded system. What is the minimum number of additional queues required? Explain. How many additional servers are required to ensure the utilization is less than or equal to 50%? Explain. If the...
Consider a two-server queue with Exponential arrival rate λ. Suppose servers 1 and 2 have exponential...
Consider a two-server queue with Exponential arrival rate λ. Suppose servers 1 and 2 have exponential rates μ1 and μ2, with μ1 > μ2. If server 1 becomes idle, then the customer being served by server 2 switches to server 1. a) Identify a condition on λ,μ1,μ2 for this system to be stable, i.e., the queue does not grow indefinitely long. b) Under that condition, and the long-run proportion of time that server 2 is busy.
Consider a two-server queue with Exponential arrival rate λ. Suppose servers 1 and 2 have exponential...
Consider a two-server queue with Exponential arrival rate λ. Suppose servers 1 and 2 have exponential rates µ1 and µ2, with µ1 > µ2. If server 1 becomes idle, then the customer being served by server 2 switches to server 1. a) Identify a condition on λ, µ1, µ2 for this system to be stable, i. e., the queue does not grow infinitely long. b) Under that condition, find the long-run proportion of time that server 2 is busy.
The time between arrivals of parts in a single machine queuing system is uniformly distributed from...
The time between arrivals of parts in a single machine queuing system is uniformly distributed from 1 to 20 minutes (for simplicity round off all times to the nearest whole minute.) The part's processing time is either 8 minutes or 14 minutes. Consider the following case of probability mass function for service times: Prob. of processing (8 min.) = .5, Prob. of processing (14 min.) = .5 Simulate the case, you need to estimate average waiting time in system. Start...
Consider an Erlang service system (M / Ek / 1) in which no queue is allowed...
Consider an Erlang service system (M / Ek / 1) in which no queue is allowed to form. Let n = the number of stages of service left in the system, and let pn be the equilibrium probability of being in state n. (a) Write flow balance equations. (b) Find an expression for pn, n = 0, 1, ..., k (c) Find the probability of a busy system.
Two hundred workstations and four servers on a single LAN are connected by a number of...
Two hundred workstations and four servers on a single LAN are connected by a number of switches. You're seeing an excessive number of broadcast packets throughout the LAN and want to decrease the effect this broadcast traffic has on your network. What steps must you take to achieve this goal?
Why a circular queue is more benefiting than a single dimension array queue? How to do...
Why a circular queue is more benefiting than a single dimension array queue? How to do indexing in a circular queue? (explain briefly in java)
Question 2. In this question you will be comparing two different queuing configurations to see which...
Question 2. In this question you will be comparing two different queuing configurations to see which one is better in reducing delays. NOTE: SHOW ALL YOUR WORK. USE 4 DECIMAL PLACES IN ALL CALCULATIONS. Historical data at a retail store (e.g. Walmart) shows that the total average arrival rate of customers to checkout lanes (cashiers) at the store is 240 customers per hour during the peak hours. The arrivals can be modeled by a Poisson distribution. There are 20 cashiers...
Consider the following two-server one-queue system from time = 0 to time = 20 min. If...
Consider the following two-server one-queue system from time = 0 to time = 20 min. If both servers are available when a customer arrives, the customer will choose server1. Customers waiting in the queue enter service whenever any one of the two servers becomes available (first come, first serve). Arrivals and service times are: • Customer #1 arrives at t = 0 and requires 2 minutes of service time • Customer #2 arrives at t = 1 and requires 5...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT