Analysis of polling systems
Poisson input queueing system with startup time and under control-operating policy
Computers and Operations Research
On the optimal control of two queues with server setup times and its analysis
SIAM Journal on Computing
Efficient visit frequencies for polling tables: minimization of waiting cost
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications - Polling models
Efficient visit orders for polling systems
Performance Evaluation
Heuristic scheduling of parallel heterogeneous queues with set-ups
Management Science
A Practical Scheduling Method for Multiclass Production Systems with Setups
Management Science
Mathematics of Operations Research
Dynamic Scheduling of a Two-Class Queue with Setups
Operations Research
Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
Queueing Systems: Theory and Applications
Mathematics of Operations Research
Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules
Operations Research
Computing an index policy for bandits with switching penalties
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs
INFORMS Journal on Computing
| Hi-index | 0.00 |
This paper addresses the problem of designing a tractable scheduling rule for a multiclass M /G /1 queue incurring class-dependent linear holding costs and setup costs, as well as class-dependent generally distributed setup times, which performs well relative to the discounted or average cost objective. We introduce a new dynamic scheduling rule based on priority indices which emerges from deployment of a systematic methodology for obtaining marginal productivity index policies in the framework of restless bandit models, introduced by Whittle (1988) and developed by the author over the last decade. For each class, two indices are defined: an active and a passive index, depending on whether the class is or is not set up, which are functions of the class state (number in system). The index rule prescribes to engage at each time a class of highest index: it thus dynamically indicates both when to leave the class being currently served, and which class to serve next. The paper (i) formulates the problem as a semi-Markov multiarmed restless bandit problem; (ii) introduces the required extensions to previous indexation theory; and (iii) gives closed index formulae for the average criterion.