Optimally of shortest queue routing for dependent service stations

1 December 1987

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 1069-1072
https://doi.org/10.1109/cdc.1987.272565

Abstract

We consider a system in which customers arrive singly or in batches to a group of service stations. Via a Markov decision process argument, we establish general conditions on the state-dependent arrival, service and holding cost rates such that shortest queue routing (SQR) is optimal. In particular, our conditions allow each station to be a ·/M/s queue.

Keywords

ROUTING
CONTROL SYSTEMS
COSTS
OPTIMAL CONTROL
ELECTRICAL EQUIPMENT INDUSTRY
INDUSTRIAL CONTROL
SYSTEMS ENGINEERING AND THEORY
CONTRACTS
FORCE CONTROL
STOCHASTIC PROCESSES

This publication has 0 references indexed in Scilit: