Sample path methods in the control of queues
From MaRDI portal
Publication:1923637
Recommendations
Cites work
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 3709371 (Why is no real title available?)
- scientific article; zbMATH DE number 3733034 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- scientific article; zbMATH DE number 3338194 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A new ordering for stochastic majorization: theory and applications
- A new proof of finite moment conditions for GI/G/1 busy periods
- A simple dynamic routing problem
- An extremal property of FIFO discipline in G/IFR/1 queues
- Branching Bandit Processes
- Comparisons of service disciplines in a tandem queueing network with real time constraints
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
- Deciding Which Queue to Join: Some Counterexamples
- Effects of service disciplines in \(G/GI/s\) queueing systems
- Extensions of the multiarmed bandit problem: The discounted case
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Extremal scheduling of parallel processing with and without real-time constraints
- Interchange arguments for classical scheduling problems in queues
- Interchange arguments in stochastic scheduling
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- On optimal polling policies
- On the Optimality of the Generalized Shortest Queue Policy
- On the duality between routing and scheduling systems with finite buffer space
- On the optimal assignment of customers to parallel servers
- Optimal load balancing on distributed homogeneous unreliable processors
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimal scheduling in a machine with stochastic varying processing rate
- Optimality of routing and servicing in dependent parallel processing systems
- Optimality of the round-robin routing policy
- Optimality of the shortest line discipline
- Rearrangement Inequalities
- Routing with limited state information in queueing systems with blocking
- Sample Path Criteria for Weak Majorization
- Stochastic Scheduling in in-Forest Networks
- Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline
- The cμ rule revisited
- The µc-rule is not optimal in the second node of the tandem queue: a counterexample
- Time-Sharing Service Systems. I
Cited in
(12)- Job assignment in large-scale service systems with affinity relations
- Sample path properties of the G/D/\(m\) queue
- Erlang arrivals joining the shorter queue
- scientific article; zbMATH DE number 2088523 (Why is no real title available?)
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Scheduling in a multi-class series of queues with deterministic service times
- Partial flexibility in routeing and scheduling
- Perfect sampling of GI/GI/\(c\) queues
- Monotonicity properties for multi-class queueing systems
- Optimal threshold policies in a two-class preemptive priority queue with admission and termination control
- Dynamic admission control for loss systems with batch arrivals
- An overview for Markov decision processes in queues and networks
This page was built for publication: Sample path methods in the control of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923637)
