| New Reply |
Bernoulli single-server queueing process |
Share Thread | Thread Tools |
| Nov10-12, 09:23 PM | #1 |
|
|
Bernoulli single-server queueing process
1. The problem statement, all variables and given/known data
Performance of a car wash center is modeled by the single-server Bernoulli queueing process with 2-minute frames. Cars arrive every 10 minutes, on the average. The average service time is 6 minutes. Capacity is unlimited. If there are no cars at the center at 10 am, compute the probability that one car is being washed and another car is waiting at 10:04 am. 2. Relevant equations [itex]Δ = 2[/itex] min [itex]λ_A = .1[/itex] min[itex]^{-1}[/itex] [itex]λ_S = .167[/itex] min[itex]^{-1}[/itex] [itex]p_A = λ_AΔ = .2[/itex] [itex]p_S = λ_SΔ = .333[/itex] [itex]p_{00} = 1-p_A = .8[/itex] [itex]p_{01} = p_A = .2[/itex] [itex](1-p_A)p_S = .267[/itex] [itex](1-p_S)p_A = .133[/itex] [itex]1 - .267 - .133 = .6[/itex] 3. The attempt at a solution Using the above calculations I formed this transition probability matrix: [itex]P = \begin{pmatrix} .8 & .2 & 0 & 0 & \dots\\ .267 & .133 & .6 & 0 & \dots\\ 0 & .267 & .133 & .6 & \dots\\ 0 & 0 & .267 & .133 & \dots\\ \vdots & \vdots & \vdots & \vdots & \ddots \end{pmatrix}[/itex] With no cars in the system, the initial distribution is: [itex]P_0 = \begin{pmatrix}1&0&0&0\end{pmatrix}[/itex] With a frame size of 2 minutes, 10:04 is 2 frames away from 10:00, thus the distribution after 2 frames is: [itex]P_2 = P_0P^6 = \begin{pmatrix}1&0&0&0\end{pmatrix}\cdot P^2[/itex] [itex]= \begin{pmatrix}.6934&.1866&.12&0\end{pmatrix}[/itex] And the probability for two cars to be in the system after 2 frames is [itex]P_2(2) = .12[/itex] But that's not accepted as the right answer. The answer in the back of the book says [itex]\frac{2}{75}[/itex], but that's not even anywhere in the matrix of [itex]P^2[/itex]. Any idea what I'm doing wrong? |
| Nov10-12, 09:58 PM | #2 |
|
Recognitions:
|
Shouldn't the second row of the matrix read:
10: 0.8*1/3 = .267 11: 0.8*2/3 + .2*1/3 = 0.6 12: 0.2*2/3 = .133 ? |
| Nov10-12, 10:04 PM | #3 |
|
|
Ah... now I see. The example in my book had it ordered somewhat oddly. After swapping those around, I do indeed get the correct answer of .0266. Thanks!
|
| Nov11-12, 03:50 AM | #4 |
|
Recognitions:
|
Bernoulli single-server queueing process[tex] \lambda_A = 1/10,\; \lambda_S = 1/6\\ p_A = 1/5,\; p_S = 1/3\\ p_{00} = 4/5, \; p_{01} = p_A = 1/5\\ (1-p_A)p_S = (4/5)(1/3) = 4/15, \; (1-p_S)p_A = (2/3)(1/5) = 2/15\\ 1 - 4/15 - 2/15 = 9/15 = 3/5 [/tex] Later, you can round off, and to get *accurate* multi-step probabilities (via Pn) you should keep a lot more digits in P---full machine floating-point accuracy would be best. (Of course, maybe you did keep all those figures and just rounded off for presentation purposes, in which case you should say so.) RGV |
| New Reply |
| Thread Tools | |
Similar Threads for: Bernoulli single-server queueing process
|
||||
| Thread | Forum | Replies | ||
| Why html data has to be send to a different server to process? | Computers | 18 | ||
| M/D/1/n Queueing Theory help | Set Theory, Logic, Probability, Statistics | 4 | ||
| Bernoulli Process Statistics | Calculus & Beyond Homework | 0 | ||
| Queueing theory. Help! | Set Theory, Logic, Probability, Statistics | 0 | ||
| queueing theory | Introductory Physics Homework | 0 | ||