Optimality of routing and servicing in dependent parallel processing systems
Queueing Systems: Theory and Applications
Routing in the presence of breakdowns
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Optimal Control: Basics and Beyond
Optimal Control: Basics and Beyond
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Routing among different nodes where servers break down without losing jobs
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements
Mathematics of Operations Research
| Hi-index | 0.00 |
We argue the importance of problems concerning the dynamic routing of tasks for service in environments where the servers have diverse characteristics and are subject to breakdown. We propose a general model in which both service times and repair times at each machine are i.i.d.with some general distribution. Routing decisions take account of queue lengths, machine states (up or down), the elapsed processing times of jobs in service and the times to date of any machine repairs in progress. We develop an approach to machine calibration which yields a machine index which is a function of all of the preceding information. The heuristic which routes all tasks to the machine of current smallest index performs outstandingly well. The approach of the paper is flexible and is capable of yielding strongly performing routing policies for a range of variants of the basic model. These include cases where job processing is lost at each breakdown and where the machine state may be only partially observed.