Question: An important unit consists of two components placed in parallel

An important unit consists of two components placed in parallel. The unit performs satisfactorily if one of the two components is operating. Therefore, only one component is operated at a time, but both components are kept operational (capable of being operated) as often as possible by repairing them as needed. An operating component breaks down in a given period with probability 0.2. When this occurs, the parallel component takes over, if it is operational, at the beginning of the next period. Only one component can be repaired at a time. The repair of a component starts at the beginning of the first available period and is completed at the end of the next period. Let Xt be a vector consisting of two elements U and V, where U represents the number of components that are operational at the end of period t and V represents the number of periods of repair that have been completed on components that are not yet operational. Thus, V = 0 if U = 2 or if U = 1 and the repair of the nonoperational component is just getting under way. Because a repair takes two periods, V = 1 if U = 0 (since then one nonoperational component is waiting to begin repair while the other one is entering its second period of repair) or if U = 1 and the nonoperational component is entering its second period of repair. Therefore, the state space consists of the four states (2, 0), (1, 0), (0, 1), and (1, 1). Denote these four states by 0, 1, 2, 3, respectively. {Xt} (t = 0, 1, . . .) is a Markov chain (assume that X0 = 0) with the (one-step) transition matrix
(a) What is the probability that the unit will be inoperable (because both components are down) after n periods, for n = 2, 5, 10, 20?
(b) What are the steady-state probabilities of the state of this Markov chain?
(c) If it costs $30,000 per period when the unit is inoperable (both components down) and zero otherwise, what is the (long-run) expected average cost per period?

View Solution:

Sale on SolutionInn
  • CreatedSeptember 22, 2015
  • Files Included
Post your question