Estimate the balking rate, Operating System

People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back in 60 ± 20 minutes. The others leave and do not return. One barber gives haircut in 8 ± 2 minutes, whereas the second talks a lot and it takes 12 +/- 4 minutes. If both barbers are idle, a customer prefers the first barber. Treat customers trying to reenter the shop as if they are new customers. Simulate the system until 300 customers have received the haircut.

a. Estimate the balking rate, that is, the number turned away per minute.

b. Estimate the number turned away per minute who do not try again.

c. What is the average time spent in the shop?

d. What is the average time spent getting a hair cut, not including the delay?

e. What is the average number of customers in the shop?

Posted Date: 3/25/2013 5:40:57 AM | Location : United States

Related Discussions:- Estimate the balking rate, Assignment Help, Ask Question on Estimate the balking rate, Get Answer, Expert's Help, Estimate the balking rate Discussions

Write discussion on Estimate the balking rate
Your posts are moderated
Related Questions
Explain in detail about ipc in linux

BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will

Introduction of linux

categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..

Explain the TlsSetValue (TLSindex, dataPtr)Function The TlsSetValue function  associates the  dataPtr passed as a parameter as local storage for the requesting thread. The asso

Gang Scheduling : A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be sched

Discuss in detail Table management Techniques?     An Assembler employs the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and its machi

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

scattered resposibi;ity and authority -necessity of operation research