Article ID: | iaor20052585 |
Country: | United States |
Volume: | 51 |
Issue: | 6 |
Start Page Number: | 856 |
End Page Number: | 872 |
Publication Date: | Sep 2004 |
Journal: | Naval Research Logistics |
Authors: | Glazebrook K.D., Kirkbride C. |
Keywords: | scheduling, programming: dynamic |
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed.