Sequencing Problems in Two-Server Systems
From MaRDI portal
Recommendations
- Optimal Sequencing in Multiserver Systems
- Sequencing and scheduling \(N\) customers for a stochastic server
- Optimal server assignment in a two-stage tandem queueing system
- Publication:3481475
- On a queueing system with sequential service
- The generalized two-server problem
- Dynamic server assignment in a two-queue model
- Sequential versus simultaneous assignment systems and two applications
Cited in
(17)- Queueing models of secondary storage devices
- A discrete-state model of the two-headed disk
- A selection-replacement process on the circle
- On-line algorithms for locating checkpoints
- A randomized algorithm for two servers on the line.
- One-dimensional service networks and batch service queues
- Stochastic dominance and the bijective ratio of online algorithms
- Sequencing two servers on a sphere
- scientific article; zbMATH DE number 1194425 (Why is no real title available?)
- Multiple anticipatory moves of a server on a line
- Optimal Computer Disk Access
- Polling, Greedy and Horizon Servers on a Circle
- A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited
- Optimal Sequencing in Multiserver Systems
- Seek distances in two-headed disk systems
- SIMPLE: An optimal disk system with two restricted heads
- Seek distances in disks with two independent heads per surface
This page was built for publication: Sequencing Problems in Two-Server Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724071)
