Priority Queues with Semi-Exhaustive Service and Class-Dependent Setup Times
This paper considers a new type of priority queues with semi-exhaustive service and setup times, which operates as follows : A single server continues serving class-n messages in queue n until the number of messages decreases to one less than that found upon the server's last arrival at queue n, where 1≤n≤N. In succession, messages of the highest class present in the system, if any, will be served according to this semi-exhaustive service. The following two class-dependent setup-time models are considered : Setup Time I (the first service after a setup time is given to the first arrival during an idle period), and Setup Time II (the first service after a setup time is given to the highest class message in the system at the end of the setup time).
富山県立大学紀要 7, 100-109, 1997-03-27