How to exclude combinations for defined sequences?

Click For Summary
SUMMARY

This discussion focuses on calculating the probability of a factory having to close its production line due to product failures over various time frames. The factory can tolerate up to 2 failures in a rolling 12-month period, with a failure probability of 0.05 per month. The user successfully calculated probabilities for 12 and 13 months but struggles with the 15-month and 10-year scenarios, seeking a general rule to exclude combinations that lead to shutdowns. The problem is identified as a modified runs problem, potentially solvable using Markov chains or renewal models.

PREREQUISITES
  • Understanding of binomial probability distributions
  • Familiarity with combinatorial mathematics
  • Knowledge of Markov chains and renewal theory
  • Basic concepts of probability theory
NEXT STEPS
  • Study binomial probability calculations in depth
  • Learn about Markov chains and their applications in probability problems
  • Research renewal theory and its relevance to failure analysis
  • Explore combinatorial techniques for exclusion-inclusion principles
USEFUL FOR

Mathematicians, statisticians, quality control analysts, and anyone involved in reliability engineering or risk assessment in manufacturing environments.

Josefk
Messages
2
Reaction score
0
Please can anyone help with the below problem? It’s an interesting problem but please bear with me as i don't have much math background.

A factory’s product is sampled once per month every month by its quality inspection team. The factory is allowed up to 2 product failures per ROLLING 12 month period (i.e. Mar-Feb, April-Mar etc) but if it fails 3 times it must close its production line. The probability of failing each sample is 0.05. Work out the probability that (given that the factory hasnt had any failures in the last 12 months) the factory will have to close its production line on AT LEAST one occasion:
a) in the next 12 months
b) in the next 13 months
c) in the next 15 months
d) in the next 10 years
********************
My answers so far:
I really need help with part c) and particularly part d).
a) using standard binomial probability (12!/3!9! x 0.05^3 x 0.95^9)+(12!/4!8! x 0.05^4 x 0.95^8)+ etc ... +(12!/12!0! x 0.05^12 x 0.95^0) = 0.0196.
b) Using the number of combinations taken from part a), i deducted from the first term those combinations that do not have 3 failures within 12 months of each other (let’s call this the ‘no shutdown’ combinations). To work this out, i reasoned the only possible combinations are those with a single failure at both ends of the range. So i did 2!/2!0! X 11!/11!0! = 11. (this seems correct after i physically sketched the combinations out!). There is no need to repeat this for the second term (for 4 failures) as there is no possible combination here that won't have 3 failures within 12 months of each other. The overall probability i calculated to be 0.0237.
c). I’m struggling to work out the number of ‘no shutdown’ combinations for 3 failures within 15 months and also for 4 failures (as this term now becomes significant). I need to be able to develop a rule for working this out. Similar to part b) i have tried to work out the combinations of failures occurring within the end 4 months of the range (i.e. months 1,2,14,15) such to avoid 3 occurring within 12 months. To do this i did (4!/3!1! X 11!/11!0!) + (4!/2!2! X 11!/10!1!) + (4!/1!3! X 11!/10!2!) = 92. However, when i sketched the combinations out by hand there are only 76, so i seem to be double counting 16 combinations using the above approach.

In order to work out part d) i will need a general rule to exclude the ‘no shutdown’ months for any number of months (m) being considered and any number of failures up to m-3.
CAN ANYONE HELP PLEASE?
 
Last edited:
Physics news on Phys.org
Josefk said:
Please can anyone help with the below problem? It’s an interesting problem but please bear with me as i don't have much math background...

d) in the next 10 years...

In order to work out part d) i will need a general rule to exclude the ‘no shutdown’ months for any number of months (m) being considered and any number of failures up to m-3.
This could be an issue. Structurally, this feels like a modified runs problem, which means it is fairly easily addressable with markov chains or a renewal model. Doing the 10 year problem with raw combinatorics may be technically possible with inclusion-exclusion, though it seems laborious and unpleasant.

So, what do you know and where is this problem coming from? If you really don't have much of a math background, I'd suggest working out all the mechanics on a, b, and c and ignoring d.edit: I may be able to frame the renewal argument as just a big linear recurrence involving mutually exclusive events -- if you're ok with such things then that should work.
 
Last edited:

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
10
Views
3K