Control of arrivals to two queues in series
type: Item
instance of: scholarly article
title: Control of arrivals to two queues in series
zbMATH Open document ID: 0569.60091
DOI: 10.1016/0377-2217(85)90160-2
author: Hussein A. Ghoneim
author: Shaler jun. Stidham
published in: European Journal of Operational Research
publication date: 1985-01-01T00:00:00Z
review text: We consider two queues in series with input to each queue, which can be controlled by accepting or rejecting arriving customers. The objective is to maximize the discounted or average expected net benefit over a finite or infinite horizon, where net benefit is composed of (random) rewards for entering customers minus holding costs assessed against the customers at each queue. Provided that it costs more to hold a customer at the first queue than at the second, we show that an optimal policy is monotonic in the following senses: Adding a customer to either queue makes it less likely that we will accept a new customer into either queue; moreover, moving a customer from the first queue to the second makes it more (less) likely that we will accept a new customer into the first (second) queue. Our model has policy implications for flow control in communication systems, industrial job shops, and traffic-flow systems. We comment on the relation between the control policies implied by our model and those proposed in the communications literature.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 3909495
zbMATH Keywords: maximize the discounted or average expected net benefit
zbMATH Keywords: finite or infinite horizon
zbMATH Keywords: communications
MaRDI profile type: Publication
full work available at URL: 0377-2217(85)90160-2
OpenAlex ID: W2008433198
cites work: A simple dynamic routing problem
cites work: Dynamic analysis of a spinning composite ``deep'' hyperbolic coupling
cites work: Optimal control of two interacting service stations
cites work: Control of arrivals to a stochastic input–output system
cites work: Optimal flow control of a class of queueing networks in equilibrium
cites work: Applying a New Device in the Optimization of Exponential Queuing Systems
cites work: Individual versus Social Optimization in Exponential Congestion Systems
cites work: The Regulation of Queue Size by Levying Tolls
cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
cites work: Q4144550
cites work: Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
cites work: On the convergence of successive approximations in dynamic programming with non-zero terminal reward
cites work: Optimal control of admission to a quenching system
cites work: Minimizing a Submodular Function on a Lattice
cites work: Q4192588
cites work: Q3912356
cites work: On the optimal assignment of customers to parallel servers
cites work: Q3698635
cites work: Optimality of the shortest line discipline
description: scientific article; zbMATH DE number 3909495