On the value function of the M/G/1 FCFS and LCFS queues

DOI10.1239/JAP/1354716657MaRDI QIDQ4903042zbMATH OpenOpenAlexFDO

Authors Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Jorma Virtamo

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

zbMATH Keywords

\(M/G/1\)FCFSLCFSmean delaysojourn timevalue function

Mathematics Subject Classification ID

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

Recommendations

• Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline
• Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
• On optimality of the FCFS discipline in multiserver queueing systems and networks
• Effects of service disciplines in \(G/GI/s\) queueing systems
• On the value function of the M/Cox(r)/1 queue

Cites work

• A heuristic rule for routing customers to parallel servers
• A simple dynamic routing problem
• Allocation of tasks to specialized processors: A planning approach
• Asymptotic convergence of scheduling policies with respect to slowdown
• Conditional Ages and Residual Service Times in the M/G/1 Queue
• Deciding Which Queue to Join: Some Counterexamples
• Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1514781 (Why is no real title available?)
• scientific article; zbMATH DE number 5685899 (Why is no real title available?)
• Managing Queues with Heterogeneous Servers
• On the optimal assignment of customers to parallel servers
• On the value function of the M/Cox(r)/1 queue
• Optimal load balancing on distributed homogeneous unreliable processors
• Optimality of the round-robin routing policy
• Optimality of the shortest line discipline
• Queuing Models with Lane Selection: A New Class of Problems
• Size- and state-aware dispatching problem with queue-specific job sizes
• Technical Note—The Expected Remaining Service Time in a Single Server Queue
• The autostrada queueing problem

Cited in

(6)

• Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
• 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
• Optimality of first-come-first-served: a unified approach
• On the value function of the M/Cox(r)/1 queue
• Externalities in Queues as Stochastic Processes: The Case of FCFS M/G/1

This page was built for publication: On the value function of the M/G/1 FCFS and LCFS queues

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