The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times

Recommendations

A polling system with `join the shortest -- serve the longest' policy
A 3-queue polling system with join the shortest-serve the longest policy
Two queues with a single server
Analysis of the asymmetric shortest queue problem with threshold jockeying
Deciding Which Queue to Join: Some Counterexamples

Cites work

scientific article; zbMATH DE number 4041013 (Why is no real title available?)
scientific article; zbMATH DE number 3736680 (Why is no real title available?)
A 3-queue polling system with join the shortest-serve the longest policy
A polling system with `join the shortest -- serve the longest' policy
A retrial system with two input streams and two orbit queues
A two-queue, one-server model with priority for the longer queue
An \(M/M/1\) queue in random environment with disasters
Analysis of the asymmetric shortest queue problem
Analysis of the asymmetric shortest queue problem with threshold jockeying
Analysis of the asymmetrical shortest two-server queueing model
Analysis of the symmetric join the shortest orbit queue
Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
Dynamic priority rules for cyclic-type queues
Exact analysis for multiserver queueing systems with cross selling
Explicit solutions for continuous-time QBD processes by using relations between matrix geometric analysis and the probability generating functions method
Introduction to Matrix Analytic Methods in Stochastic Modeling
Join the shortest queue with many servers. The heavy-traffic asymptotics
ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
On customers acting as servers
On the Optimality of the Generalized Shortest Queue Policy
On the infinite server shortest queue problem: non-symmetric case
On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
Optimality of the shortest line discipline
Performance analysis of joining the shortest queue model among a large number of queues
Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism
Performance modeling and design of computer systems. Queueing theory in action
Recent extensions of \textit{Descartes}' rule of signs.
Retrial Queueing Systems
Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime
The Israeli Queue with priorities
The Longer Queue Model
The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes
The shorter queue polling model
The shortest queue problem
The symmetric longest queue system
Two-queue polling systems with switching policy based on the queue that is not being served

This page was built for publication: The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times

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