Queuing with future information
DOI10.1214/13-AAP973zbMath1309.60090arXiv1211.0618MaRDI QIDQ744387
Publication date: 25 September 2014
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0618
random walkqueueing theoryresource poolingadmissions controlfuture informationheavy-traffic asymptotics
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic resource pooling in parallel-server systems
- On Pooling in Queueing Networks
- Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
- Markov Decision Problems and State-Action Frequencies
- Optimal control of admission to a quenching system
- Time-average optimal constrained semi-Markov decision processes
- Reducing the Cost of Demand Uncertainty Through Accurate Response to Early Sales
- Look-Ahead Policies for Admission to a Single Server Loss System
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands
This page was built for publication: Queuing with future information
