The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
DOI10.1007/S00186-023-00848-7zbMATH Open1547.90059MaRDI QIDQ6540473FDOQ6540473
Authors: Efrat Perel, Nir Perel, Uri Yechiali 
Publication date: 15 May 2024
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
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
queueingpollingjoin the shortest queueprobability generating functionsmatrix geometricserve the longest queue
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Retrial Queueing Systems
- A retrial system with two input streams and two orbit queues
- The shorter queue polling model
- Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
- Performance modeling and design of computer systems. Queueing theory in action
- Optimality of the shortest line discipline
- Analysis of the asymmetrical shortest two-server queueing model
- Analysis of the asymmetric shortest queue problem
- On the Optimality of the Generalized Shortest Queue Policy
- The shortest queue problem
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Title not available (Why is that?)
- On the infinite server shortest queue problem: non-symmetric case
- A two-queue, one-server model with priority for the longer queue
- The Israeli Queue with priorities
- Dynamic priority rules for cyclic-type queues
- On customers acting as servers
- Two-queue polling systems with switching policy based on the queue that is not being served
- A 3-queue polling system with join the shortest-serve the longest policy
- The Longer Queue Model
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- An \(M/M/1\) queue in random environment with disasters
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
- The symmetric longest queue system
- Recent extensions of \textit{Descartes}' rule of signs.
- Exact analysis for multiserver queueing systems with cross selling
- Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- Explicit solutions for continuous-time QBD processes by using relations between matrix geometric analysis and the probability generating functions method
- Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism
- A polling system with `join the shortest -- serve the longest' policy
- The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes
- Analysis of the symmetric join the shortest orbit queue
- Performance analysis of joining the shortest queue model among a large number of queues
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)
