chisigma
Gold Member
MHB
- 1,627
- 0
Re: Unsolved statistic questions from other sites, part II
The average cost per unit time is the sum of three components...
a) the setup cost $C_{s}$...
b) the operating cost $C_{o}$...
c) the waiting time order cost $C_{w}$...
If $\lambda$ is the mean number of orders arriving in the unit time [we supposed that u.t. is 1 hour...], then the mean number of pochets of N orders arriving in the unit time is $\displaystyle \frac{\lambda}{N}$, so that is $\displaystyle C_{s}= 54\ \frac{\lambda}{N}$. The operating time to process N orders is $\displaystyle \frac{N}{\mu}$, so that is $\displaystyle C_{o}= 720\ \frac{N}{\mu}$. The mean waiting time order is $\displaystyle \frac{1}{2}\ (\frac{N}{\lambda} + \frac{N}{\mu})$ so that the mean waiting time cost is $\displaystyle 30\ N^{2}\ (\frac{1}\lambda + \frac{1}{\mu})$. The total mean cost per hour will be... $\displaystyle C=C_{s} + C_{o} + C_{w} = 54\ \frac{\lambda}{N} + 720\ \frac{N}{\mu} + 30\ N^{2}\ (\frac{1}{\lambda} + \frac{1}{\mu})\ (1)$
C can easily be computed setting in (1) $\lambda = 20\ $ and $\mu=30\ $ ... Kind regards
$\chi$ $\sigma$
chisigma said:Posted the 06 05 2013 on www.mathhelpforum.com by the user Nazarin and not yet solved...
Consider a machine which is turned off when there is no work. It is turned on and restarts work when enough orders, say N, arrived to the machine. The setup times are negligible. The processing times are exponentially distributed with mean 1/mu and the average number of orders arriving per unit time is lambda (<mu ). Suppose that lambda = 20 orders per hour, (1/mu) = 2 minutes and that the setup cost is 54 dollar. In operation the machine costs 12 dollar per minute. The waiting cost is 1 dollar per minute per order. Determine, for given threshold N, the average cost per unit time...
The average cost per unit time is the sum of three components...
a) the setup cost $C_{s}$...
b) the operating cost $C_{o}$...
c) the waiting time order cost $C_{w}$...
If $\lambda$ is the mean number of orders arriving in the unit time [we supposed that u.t. is 1 hour...], then the mean number of pochets of N orders arriving in the unit time is $\displaystyle \frac{\lambda}{N}$, so that is $\displaystyle C_{s}= 54\ \frac{\lambda}{N}$. The operating time to process N orders is $\displaystyle \frac{N}{\mu}$, so that is $\displaystyle C_{o}= 720\ \frac{N}{\mu}$. The mean waiting time order is $\displaystyle \frac{1}{2}\ (\frac{N}{\lambda} + \frac{N}{\mu})$ so that the mean waiting time cost is $\displaystyle 30\ N^{2}\ (\frac{1}\lambda + \frac{1}{\mu})$. The total mean cost per hour will be... $\displaystyle C=C_{s} + C_{o} + C_{w} = 54\ \frac{\lambda}{N} + 720\ \frac{N}{\mu} + 30\ N^{2}\ (\frac{1}{\lambda} + \frac{1}{\mu})\ (1)$
C can easily be computed setting in (1) $\lambda = 20\ $ and $\mu=30\ $ ... Kind regards
$\chi$ $\sigma$
Last edited: