Polling Systems with Switch-over Times under Heavy Load: Moments of the Delay
Queueing Systems: Theory and Applications
Polling systems in heavy traffic: Higher moments of the delay
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Mean value analysis for polling systems in heavy traffic
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Heavy traffic analysis of polling models by mean value analysis
Performance Evaluation
Probability in the Engineering and Informational Sciences
A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
Network Control and Optimization
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements
Mathematics of Operations Research
Flexible servers in tandem lines with setup costs
Queueing Systems: Theory and Applications
Dynamic control of a flexible server in an assembly-type queue with setup costs
Queueing Systems: Theory and Applications
On the optimal control of a two-queue polling model
Operations Research Letters
Polling systems with periodic server routing in heavy traffic: renewal arrivals
Operations Research Letters
| Hi-index | 0.00 |
We analyze two scheduling problems for a queueing system with a single server and two customer classes. Each class has its own renewal arrival process, general service time distribution, and holding cost rate. In the first problem, a setup cost is incurred when the server switches from one class to the other, and the objective is to minimize the long-run expected average cost of holding customers and incurring setups. The setup cost is replaced by a setup time in the second problem, where the objective is to minimize the average holding cost. By assuming that a recently derived heavy traffic principle holds not only for the exhaustive policy but for nonexhaustive policies, we approximate (under standard heavy traffic conditions) the dynamic scheduling problems by diffusion control problems. The diffusion control problem for the setup cost problem is solved exactly, and asymptotics are used to analyze the corresponding setup time problem. Computational results show that the proposed scheduling policies are within several percent of optimal over a broad range of problem parameters.