Priority queues with semiexhaustive serv
โ
T Katayama; K Kobayashi
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 667 KB
This paper considers a new type of priority queues with semiexhaustive 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