Convergence of factory earnings
1 Answers
First consider the average money made over days on which the factory is running. The fraction of the time that the factory spends on jobs of time $i$ is $\frac{i p_i}{\sum_{j=1}^n j p_j}$ (note that the probability that a job will be accepted is not dependent on how long it will take). For each such job the factory earns an average of $E[V \mid V \geq a]$ money, with each value being independent of the rest. So the average earnings per day for jobs of length $i$ is $\frac{E[V \mid V \geq a]}{i}$. Multiplying that by the probability that we are working on a job of length $i$ on a given day gives $\frac{E[V \mid V \geq a] p_i}{\sum_j j p_j}$. We then sum that over $i$ to get $\frac{E[V \mid V \geq a]}{\sum_j j p_j}$.
Now we just multiply that by the probability that the factory is running on any given day. I conjecture that will just be $\frac{\sum_i i p_i}{\left ( \frac{1}{P(V \geq a)} - 1 \right ) + \sum_j j p_j}$, i.e. the average time of a job divided by the average time of a job plus the average time in between jobs. Try to prove or disprove that.
This gives you the "ensemble" average of the earnings per day; you'll need some kind of a strong law of large numbers to ensure that the time average converges to this.
-
0"The fraction of the time that the factory spends on jobs of time $i$ is $\frac{i p_i}{\sum_{j=1}^n j p_j}$" -- I don't think this is exactly true. For an extreme example, if there is only $D=1$ day, then each job can be processed for at least $1$ day, no matter its length. So I think it depends on the number $D$ of days there are. – 2017-02-03
-
0@pi66 As I said, the description I gave initially is about an "ensemble average" of jobs run; I left it to you to show that the time average will converge to this ensemble average. The point of that line of discussion is that the amount of time the factory spends on a job of length $i$ is proportional to *both* $p_i$ and $i$ itself. – 2017-02-03