Locating a Mobile Server Queueing Facility on a Tree Network
From MaRDI portal
Recommendations
- Optimal M/G/1 server location on a tree network with continuous link demands
- Queueing networks with mobile servers: the mean-field approach
- Determining efficient facility locations on a tree network operating as a FIFOM/G/1 queue
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- scientific article; zbMATH DE number 1569187
- Queuing analyses of a topologically tree-based local area network
- On locating path- or tree-shaped facilities on networks
- Metastability of queuing networks with mobile servers
- Finding an optimal core on a tree network with M/G/c/c state-dependent queues
Cited in
(20)- Optimal M/G/1 server location on a tree network with continuous link demands
- Mixed planar/network facility location problems
- A queueing-location model with expected service time dependent queueing disciplines
- Finding an optimal core on a tree network with M/G/c/c state-dependent queues
- Optimal parking of idle elevators under myopic and state-dependent policies
- The Stochastic Queue p-Median Problem
- Determining efficient facility locations on a tree network operating as a FIFOM/G/1 queue
- Trajectory Analysis of the Stochastic Queue Median in a Plane with Rectilinear Distances
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Locating a facility on a congested network with random lengths
- Optimal M/G/1 Server Location on a Network Having a Fixed Facility
- Technical Note—The Stochastic Queue Median Over a Finite Discrete Set
- Characterization of the Stochastic Median Queue Trajectory in a Plane with Generalized Distances
- An analysis of service schedules for the mobile k-server problem
- scientific article; zbMATH DE number 3997523 (Why is no real title available?)
- A center location problem with congestion
- Stochastic queue core problem with an efficient length on a tree network.
- The stochastic location-assignment problem on a tree
- A note on locating a central vertex of a 3-cactus graph
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
This page was built for publication: Locating a Mobile Server Queueing Facility on a Tree Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750467)