On the Value Function of the M/G/1 FCFS and LCFS Queues
From MaRDI portal
Publication:4903042
DOI10.1239/jap/1354716657zbMath1259.60108OpenAlexW2033347753MaRDI QIDQ4903042
Jorma Virtamo, Aleksi Penttinen, Esa Hyytiä, Samuli Aalto
Publication date: 19 January 2013
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jap/1354716657
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ To split or not to split: selecting the right server with batch arrivals ⋮ Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size- and state-aware dispatching problem with queue-specific job sizes
- Allocation of tasks to specialized processors: A planning approach
- Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
- Managing Queues with Heterogeneous Servers
- The autostrada queueing problem
- On the value function of the M/Cox(r)/1 queue
- Conditional Ages and Residual Service Times in the M/G/1 Queue
- Deciding Which Queue to Join: Some Counterexamples
- A simple dynamic routing problem
- Technical Note—The Expected Remaining Service Time in a Single Server Queue
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- Optimality of the round-robin routing policy
- A heuristic rule for routing customers to parallel servers
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Queuing Models with Lane Selection: A New Class of Problems
- Asymptotic convergence of scheduling policies with respect to slowdown
This page was built for publication: On the Value Function of the M/G/1 FCFS and LCFS Queues
