MHB Optimizing Markov Chain Production System Throughput w/ Exponential Rate of 50

  • Thread starter Thread starter Imarobby55
  • Start date Start date
  • Tags Tags
    Chain Markov chain
Imarobby55
Messages
1
Reaction score
0
I am new to Markov chain, i want to model this as a continuous-time Markov chain.

A wind turbine manufacturer would like to increase the throughput of its production system. For this purpose it intends to install a buffer between the pre-assembly and the final assembly of the wind turbines. The manufacturer can generate a profi t of 10.000 Euro per wind turbine. However, buffer spaces are also fairly expensive. The company estimates that one buffer space costs 5000 Euro per month. The production times for one turbine in the pre-assembly and in the final assembly are both exponentially distributed with a rate of 50. Again we assume that no failures occur, neither in the pre-assembly nor in the final production.

a) What is the optimal amount of buffer spaces the company should install? Determine the corresponding monthly pro ts.

b) Imagine the company realizes that failures can occur in both, prea-ssembly and fi nal production. How would you model this production system?

The transition(production) rate of moving from a pre-assembly to final assembly is 50.

I really don`t know how to model this problem.
 
Physics news on Phys.org
Hi there,

Welcome to MHB!

I'm trying to think through this problem as it's not immediately clear to me but I have a hunch. It sounds like we have two exponential processes and this extra part is a bridge between the two. The best case would be that there is no waiting time in the buffer for the $(n-1)$ iteration to complete in the final-assembly. The worst case would be that all the buffer spaces are filled and that the pre-assembly needs to stop in order for the final-assembly to complete the $(n-1)$ iteration and for another buffer space to open up. The trade off between the two is the cost of the buffer.

Does that sound like a correct framing of the process?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
4
Views
8K
Back
Top