1) Consider the following interarrival and service times for the first 5 customers to a single server queuing system. Customer Number Interarrival Time (min) Service Time (min) 1 3 4 2 1 3 3 4 4 2 3 5 1 For the above table, the first customer arrives at t = 0. The interarrival time between customer 1 and 2 is 3 minutes, and the interarrival time between customer 2 and 3 is 1 minute. Suppose the simulation ends at t= 16 minutes. Based on the above information, compute the following (show the intermediate steps): 1. The average number of people in queue; 2. The average waiting time in system (time in queue + time in service); 3. The server utilization.

1) Consider the following interarrival and service times for the first 5 customers to a single server queuing system. Customer Number Interarrival Time (min) Service Time (min) 1 3 4 2 1 3 3 4 4 2 3 5 1 For the above table, the first customer arrives at t = 0. The interarrival time between customer 1 and 2 is 3 minutes, and the interarrival time between customer 2 and 3 is 1 minute. Suppose the simulation ends at t= 16 minutes. Based on the above information, compute the following (show the intermediate steps): 1. The average number of people in queue; 2. The average waiting time in system (time in queue + time in service); 3. The server utilization.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.6: The M/m/s/gd/∞/∞ Queuing System

Problem 14P

See similar textbooks

Similar questions

Consider the Omega network and Butterfly network from p nodes in the leftmost column to p nodes in the rightmost column for some p=2^k. The Omega network is defined in Chapter 2 of the text book such that Si is connected to element S j if j=2i for or j=2i+1-p for See Chapter 2 in text book for its definition. The Butterfly network is an interconnection network composed of log p levels (as the omega network). In a Butterfly network, each switching node i at a level l is connected to the identically numbered element at level l + 1 and to a switching node whose number differs from itself only at the lth most significant bit. Therefore, switching node Si is connected to element S j at level l if j = i or j . Prove that for each node Si in the leftmost column and a node Sj in the rightmost column, there is a path from Si to Sj in the Omega network. Prove that for each node Si in the leftmost and a node Sj in the rightmost, there is a path from Si to Sj in the Butterfly network.
Consider 5 jobs having the processing times pj, due-dates dj and the weights wj of the jobs j=1, ..., 5, given in the table: Jobs 1 2 3 4 5 pj 8 6 5 4 2 dj 10 9 7 8 3 wj 4 10 5 1 3 consider the schedule <5, 2, 3, 1, 4>, what is the makespan?
Let Tran1,Tran2 & Tran3 be three independent transactions. Where Tran1 transfers the one fourth of the A accounts fund to B account. Tran2 updates the balance of the B account by 32% & Tran3 transaction provides two third of the prior balance of the A account (before providing funds to B account) to the charity account. Now write down the concurrent transactions according to the serial given above.
You are organizing a big dinner party for your company retreat. To increase social interaction among the various departments in your company, you would like to set up a seating arrangement so that no two members of the same departments are at the same table. Show how to formulate the problem of finding a seating arrangement that meets this objective as a maximum flow problem. Assume that the company has n departments, and the ith department has mi members. Also assume that t tables are available and the jth table has a seating capacity of cj. Provide a step by step algorithm for this problem for maximizing the flow and analyze its running time.
Consider Pastry network that uses DHT, in which m=4 and b=2. Currently the network has 7 nodes, N01, N03, N11, N12, N20, N23, and N33, and 4 keys, K10, K13, K21, and K30. Although it is unrealistic, assume that the proximity metric between each two nodes is based on numerical closeness. The following path is the node N12’s routing response to the query asking for the key K30: A. N12 ► N33. B. N12 ► N33 ► N23. C. N12 ► N03 ► N33. D. None of the above.
The Manhattan Tourist Problem (1) Given setting in Figure 6.4, calculate exact number of different paths by dynamic programming. (2) For a general setting, i.e., from source(0,0) to sink (n, m), how many different paths by dynamic programming?1 4 3 3 4 1 0 4 3 N 5 1
Consider the following tele-traffic scenario faced by the Nizwa Firq Telephone Exchange. On a particular day from 6am to 6.15am, the exchange handles 8 calls of average call duration 1 mins. The number of calls and the average call duration both doubles (from its values in previous time slot) every 15 mins untill 7am. Calculate the total traffic handled by the telephone exchange for the time duration 6am to 7am.
Suppose a system runs three types of transactions. Transactions of type A runat the rate of 50 per second, transactions of type B run at 100 per second, andtransactions of type C run at 200 per second. Suppose the mix of transactionshas 25 percent of type A, 25 percent of type B, and 50 percent of type C. a. What is the average transaction throughput of the system, assuming there is no interference between the transactions? b. What factors may result in interference between the transactions of different types, leading to the calculated throughput being incorrect?
In Example 13.4 of section 13.5, we examined whether an M/M/1 system with a single fast server is better or worse than an MMs system with several slow servers. Keeping the same inputs as in the example, use simulation to see whether you obtain the same type of results as with the analytical models. Then repeat, using gamma-distributed service times with standard deviation six minutes. Example 13.4 COMPARING ONE FAST SERVER TO SEVERAL SLOW SERVERS Which system has the better steady-state characteristics such as L, W, LQ, and WQ: a single-server system where the single server can serve 30 customers per hour or a five-server system where each of the servers can serve six customers per hour? For each system, we assume that customers arrive according to a Poisson process at rate 25 per hour. Objective To see whether customers should prefer a system with one fast server or a system with several slower servers. Example 13.5 INCREASINGLY LONG LINES AT COUNTY BANK Over a period of time,…
Consider the following maximum-claim reusable resource system with four processes (P0, P1, P2, P3) and three resource types (R0, R1, R2). The maximum claim matrix C is given as: R0 R1 R2 P0 4 1 4 P1 3 1 4 P2 5 6 13 P3 1 1 6 Where Cij denotes the maximum claim of the process i for resource j. The total number of units of each resource type is given by the vector: R0 R1 R2 5 8 15 The current allocation of resources is given by matrix A: R0 R1 R2 P0 0 1 4 P1 2 0 3 P2 1 4 1 P3 1 0 3 Answer the following question about the system: For the system state shown above, determine if a new request by process P2 for 6 units of resource R2 can be safely granted. (Remark: You can assume that the system state above does not yet accommodate this request.). Explain your reasoning. If the request cannot be safely granted, how should the system behave with respect to the request?
Consider the following maximum-claim reusable resource system with four processes (P0, P1, P2, P3) and three resource types (R0, R1, R2). The maximum claim matrix C is given as: R0 R1 R2 P0 4 1 4 P1 3 1 4 P2 5 6 13 P3 1 1 6 Where Cij denotes the maximum claim of the process i for resource j. The total number of units of each resource type is given by the vector: R0 R1 R2 5 8 15 The current allocation of resources is given by matrix A: R0 R1 R2 P0 0 1 4 P1 2 0 3 P2 1 4 1 P3 1 0 3 Answer the following questions about the system: Determine if the current state of the system is safe. Explain your reasoning and calculation path.
A shop owner has 2 outlets namely a High Street Branch and Mall Branch, before Covid-19 lockdown the respective shops recorded sales as follows: high stree branch Quarter sales sales sales Q1 42,000 48,000 50,000 Q2 52,000 58,000 60,000 Q3 46,000 49,000 58,000 Q4 50,000 51,000 61,000 Mall Branch Quarter Q1 57,000 63,000 60,000 Q2 70,000 67,000 72,000 Q3 67,000 65,000 62,000 Q4 72,000 69,000 75,000 As a programmer hired by the shops’ owner, write a java program to calculate: (a) the monthly combine sales figures for both shops; (b) the respective shops annual sales figures; (c) the grand annual combine total sales figures. Note: Your program must be implemented with arrays.