The following pages link to The shortest queue problem (Q3738364):
Displaying 27 items.
- The shorter queue polling model (Q333083) (← links)
- Analysis of job assignment with batch arrivals among heterogeneous servers (Q439346) (← links)
- A numerically stable algorithm for two server queue models (Q804099) (← links)
- Optimality of routing and servicing in dependent parallel processing systems (Q1177919) (← links)
- Upper and lower bounds for the waiting time in the symmetric shortest queue system (Q1315342) (← links)
- A level-crossing approach to the solution of the shortest-queue problem (Q1382808) (← links)
- Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing (Q1652039) (← links)
- Stationary analysis of the shortest queue problem (Q1688928) (← links)
- Steady-state analysis of shortest expected delay routing (Q1691915) (← links)
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (Q1801806) (← links)
- Approximating the mean response time of parallel queues with JSQ policy (Q1919783) (← links)
- Martingales and buffer overflow for the symmetric shortest queue model (Q2294090) (← links)
- A polling system with `join the shortest -- serve the longest' policy (Q2337379) (← links)
- Bad luck when joining the shortest queue (Q2378388) (← links)
- Some first passage time problems for the shortest queue model (Q2425550) (← links)
- Web server load balancing: a queueing analysis (Q2462160) (← links)
- On the infinite server shortest queue problem: non-symmetric case (Q2494544) (← links)
- Analysis of the asymmetric shortest queue problem (Q2640244) (← links)
- COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS (Q2746234) (← links)
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime (Q3387914) (← links)
- On the Shortest Queue Policy for the Tandem Parallel Queue (Q3416033) (← links)
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE (Q4678853) (← links)
- Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues (Q5193218) (← links)
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics (Q5219674) (← links)
- A 3-queue polling system with join the shortest-serve the longest policy (Q6135890) (← links)
- Cost-aware defense for parallel server systems against reliability and security failures (Q6152586) (← links)
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times (Q6540473) (← links)
