sdg wrote:
Hiya!
I've been thinking on this overnight but not certain how to do it and wondered if any of my clever pals could help me.
I have three machines, we'll call them A, B and Z. A and B feed Z. If A has a cycle time of 228 seconds, B has a cycle time of 120 seconds and Z has a cycle time of 65 seconds, what is the easiest way to build a calculation that shows how quickly Z can empty a queue of 20 items from A and B, considering A and B are still running and therefore topping up the queue?
How do I chart that, to show the point where the queue is taken care of?
Do you need to chart it?
Take a time period divisible by both of the A/B machines, such as 43,320 seconds.
In that time Machine A has added 190 items (43320/228)
In that time Machine B has added 361 items (43320/120)
A total of 551 items. How long does that take Z to remove?
65*551 = 35,815.
So it can easily keep them clear.
For 20 items I guess you could chart them, to show on which seconds the two machines feed it. So the first sequence would be:
A - 228, 456, 684, 912, 1140, 1368 etc
B - 120, 240, 360, 480, 600, 720, 840, 960, etc
Mark the seconds they hit the queue, and if Z is 'busy' at that time.
I need to go to work now though.