First in, First out v.s. last in first out - in Temple queue
For the sake of argument, let's have a reserved queue of 1 million names started well over a decade ago. Which names will be picked to be done by the system first, the last one entered or the first one submitted?
When will the first one submitted decades ago, get queued in for temple work?
At the moment, (I do not have that million names, but I know someone who does) I see in my own experience, that names I have submitted a while ago, will never get addressed by the system until any recent names have been tagged, printed and processed first.
For those first names to be completed by the system, I have to stop submitting names until that first name is finally addressed.
Can we please have this process reversed, so the system looks at the oldest names submitted first and pulls those for processing? In programming, we call it FIFO instead of LIFO. It should be simple enough to implement.