CONVEXITY IN TANDEM QUEUES

DOI10.1017/S0269964804181023MaRDI QIDQ4460796zbMATH OpenOpenAlexFDO

Authors Ger Koole

Publication date 29 March 2004

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964804181023

zbMATH Keywords

convexityevent-based dynamical programmingM/M/1 queuetandem queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39)

Recommendations

• Strong Convexity Results for Queueing Systems
• scientific article; zbMATH DE number 823434
• Convexity results for single-server queues and for multiserver queues with constant service times
• Technical Note—A Convexity Result for a Class of GI/G/1 Queueing Systems
• The convexity of a general performance measure for multiserver queues

Cited in

(10)

• Convexity of single stage queueing systems with bulk arrival
• Optimal dispatching in a tandem queue
• Optimal production, pricing, and substitution policies in continuous review production-inventory systems
• Convex duality and the Skorokhod problem. II
• Repairable stocking and expediting in a fluctuating demand environment: optimal policy and heuristics
• Convergence of tandem Brownian queues
• An overview for Markov decision processes in queues and networks
• Monotone optimal control for a class of Markov decision processes
• Optimal control of a two-server heterogeneous queueing system with breakdowns and constant retrials
• Optimal and heuristic policies for production and inventory controls in dual supply chains with fluctuating demands

This page was built for publication: CONVEXITY IN TANDEM QUEUES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4460796)