Time-Sharing Service Systems. I
From MaRDI portal
Publication:4157796
Cited in
(48)- A queueing network with a single cyclically roving server
- Optimal adaptive server allocation in a network
- Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback
- Optimal routeing in two-queue polling systems
- Workloads and waiting times in single-server systems with multiple customer classes
- Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting
- Stochastic scheduling of parallel queues with set-up costs
- Queueing models of secondary storage devices
- Tax problems in the undiscounted case
- Branching Bandit Processes
- Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers
- Multi-Actor Markov Decision Processes
- Four proofs of Gittins' multiarmed bandit theorem
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- Two-armed restless bandits with imperfect information: stochastic control and indexability
- Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- Dynamic scheduling with uncertain job types
- Re-entrant lines
- Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
- A survey of Markov decision models for control of networks of queues
- On the Gittins index in the M/G/1 queue
- Mathematical problems in the theory of processor-sharing queueing systems
- Approximation results in parallel machines stochastic scheduling
- Optimal inspection effort and scheduling for a manufacturing process with repair
- Interchange arguments for classical scheduling problems in queues
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- On scheduling a multiclass queue with abandonments under general delay costs
- Dynamic priority allocation via restless bandit marginal productivity indices
- Sample path methods in the control of queues
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- Processor-sharing queues: Some progress in analysis
- Optimal adaptive control of priority assignment in queueing systems
- Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvement
- Optimal assignment policy of a single server attended by two queues
- Multiple feedback at a single-server station
- Optimal intensity control of a multi-class queue
- Optimal intensity allocation of single-server queueing networks
- Denumerable semi-Markov decision chains with small interest rates
- Decomposition method application to a large scale linear programming WIP projection model
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- A fluid approach to large volume job shop scheduling
- Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
- Optimal scheduling policies in time sharing service systems
- The single-server scheduling problem with convex costs
- Dynamic scheduling in manufacturing systems using Brownian approximations
- A method for solving stationary equations for priority time-sharing service process in random environment
- The existence of sensitive optimal policies in two multi-dimensional queueing models
This page was built for publication: Time-Sharing Service Systems. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157796)