Monotonicity properties of cost functions in queueing networks

DOI10.1007/BF01796827zbMath0743.60104OpenAlexW2067954255MaRDI QIDQ1186501

Christos G. Cassandras, Panayotis D. Sparaggis

Publication date: 28 June 1992

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01796827

zbMATH Keywords

counterexamplequeueing networksmonotonicity propertiesblocking penalties

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• Multivariate Stochastic Orderings and Positive Dependence in Reliability Theory
• Optimal control of two interacting service stations
• The cμ rule revisited
• Optimal control of a queueing system with two interacting service stations and three classes of impatient tasks
• Multivariate hazard rates and stochastic ordering
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Monotonicity of throughput in non-Markovian networks
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
• Comparing counting processes and queues
• A simple dynamic routing problem
• Optimal control of service in tandem queues
• Optimal scheduling of two competing queues with blocking
• Monotonicity in Generalized Semi-Markov Processes
• Applying a New Device in the Optimization of Exponential Queuing Systems

This page was built for publication: Monotonicity properties of cost functions in queueing networks