Static and dynamic server allocation in systems with on/off sources
From MaRDI portal
Recommendations
- Optimal Dynamic Server Allocation in Systems with On/Off Sources
- Optimal and heuristic policies for dynamic server allocation
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 1054733
- Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- Assigning a single server to inhomogeneous queues with switching costs
- Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups
- On optimal polling policies
- Optimal and heuristic policies for dynamic server allocation
- Stochastic scheduling of parallel queues with set-up costs
- Structural results for the control of queueing systems using event-based dynamic programming
- The cμ rule revisited
- The Interrupted Poisson Process As An Overflow Process
Cited in
(5)- Allocating flexible servers in serial systems with switching costs
- Optimal and heuristic policies for dynamic server allocation
- Allocating servers in infostations for bounded simultaneous requests
- Server allocation subject to variance constraints
- Optimal Dynamic Server Allocation in Systems with On/Off Sources
This page was built for publication: Static and dynamic server allocation in systems with on/off sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839880)