Strategies for a centralized single product multiclass M/G/1 make-to-stock queue

Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practical when service time is general. In this paper we focus on customer composition: the proportion of customers of each class to the total number of customers in the queue. We do so because the number of customers in M/G/1 queues is invariant for any nonidling and nonanticipating policy. To characterize customer composition, we consider a series of two-priority M/G/1 queues where the first service time in each busy period is different from standard service times, i.e., this first service time is exceptional. We characterize the required exceptional first service times and the exact solution of such queues. From our results, we derive the optimal cost and control for the MR and SP policies for M/G/1 make-to-stock queues

Queueing Game For Spectrum Access in Cognitive Radio Networks

In this paper, we investigate the problem of spectrum access decision-making for the Secondary Users (SUs) in the cognitive radio networks. When the Primary Users (PUs) are absent on certain frequency bandwidth, SUs can formulate a queue and wait for the Base Station (BS) to serve. The queue of the SUs will be dismissed if the PU is emerging in the system. Leveraging the queueing game approaches, the decision-making process of the SUs that whether to queue or not is studied. Both individual equilibrium and social optimization strategies are derived analytically. Moreover, the optimal pricing strategy of the service provider is investigated as well. Our proposed algorithms and corresponding analysis are validated through simulation studies

Optimization of polling systems with Bernoulli schedules

Optimization;Polling Systems;Queueing Theory;operations research