Efficient Operation of Optional Priority Queueing Systems.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
An MG1 queueing system with two classes of customers is studied. The per unit time cost of holding a customer differs for the two classes. The server has the option of serving the first customer in line at no extra charge or paying a fee to earn the right to serve any higher class customer further back in the queue. An optimal policy is found for the simple case where this fee is independent of the position in the queue of the promoted customer. For the case where the server is restricted to serving either the first customer or the first higher class customer further back in the queue, an appealing conjecture from of an optimal policy is shown to be invalid. Author
- Operations Research