Optimality of index policies for stochastic scheduling with switching penalties

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal.

[1]  Jack S. Sykes,et al.  Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times , 1970, Oper. Res..

[2]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[3]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[4]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[5]  J. Michael Harrison,et al.  Dynamic Scheduling of a Multiclass Queue: Discount Optimality , 1975, Oper. Res..

[6]  G. P. Klimov.  Time sharing service systems ii , 1978 .

[7]  J. Gittins.  Bandit processes and dynamic allocation indices , 1979 .

[8]  P. Whittle.  Multi‐Armed Bandits and the Gittins Index , 1980 .

[9]  K. Glazebrook.  On stochastic scheduling with precedence relations and switching costs , 1980, Journal of Applied Probability.

[10]  P. Whittle.  Arm-Acquiring Bandits , 1981 .

[11]  Kevin D. Glazebrook,et al.  On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs , 1981, Oper. Res..

[12]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[13]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[14]  Michael J. Ferguson,et al.  Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..

[15]  Armand M. Makowski,et al.  K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal☆ , 1985 .

[16]  Jean Walrand,et al.  Extensions of the multiarmed bandit problem: The discounted case , 1985 .

[17]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[18]  高木 英明,et al.  Analysis of polling systems , 1986 .

[19]  H Takagi,et al.  Mean waiting times in nonpreemptive priority M/G/1 queues with server switchover times , 1986 .

[20]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[21]  Izhak Rubin,et al.  Polling with a General-Service Order Table , 1987, IEEE Trans. Commun..

[22]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[23]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[24]  D. Teneketzis,et al.  Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost , 1988 .

[25]  T. Lai,et al.  Open bandit processes and optimal scheduling of queueing networks , 1988, Advances in Applied Probability.

[26]  P. Nain,et al.  Interchange arguments for classical scheduling problems in queues , 1989 .

[27]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[28]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[29]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[30]  J. Walrand,et al.  Interchange arguments in stochastic scheduling , 1989 .

[31]  E. J. Collins,et al.  THE JOB SEARCH PROBLEM AS AN EMPLOYER-CANDIDATE GAME , 1990 .

[32]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[33]  R. Agrawal,et al.  Multi-armed bandit problems with multiple plays and switching cost , 1990 .