Joining policies in a multipriority multiclass batch computer system

Abstract

Consider a multipriority batch computer system which users from several different classes may join, with toll, service, and waiting charges. Such a system is formulated here as a semi-Markov decision process, in which the aim of arriving users is to minimize their expected loss. The optimal joining policy of arriving users who may join the system at some of its queues is a control limit policy, with a single control number for any possible queue and the user's class; a newly arriving user will join a queue that is not filled up to the control number corresponding to this queue and the user's class. In this paper control numbers, as well as lower and upper bounds for the control numbers and the capacities of the system's queues, are derived.

A multi-agent queuing model for resource allocations in a non-cooperative game

“…However, when customers have different value towards waiting time or urgencies, FIFO setting is no longer appropriate. Some available modifications are multi-priority/multi-class setting [2], and priority pricing setting [1,3]. This paper studies buying position in an M/D/1 queue by customers through legal/illegal activities.…”