Optimal server scheduling in nonpreemptive finite-population queueing systems
From MaRDI portal
Recommendations
- NONPREEMPTIVE SCHEDULING OF A FINITE-SOURCE QUEUE WITH TWO CUSTOMER CLASSES
- When does the c rule apply to finite-population queueing systems?
- Optimal service assignment in a finite-source queue
- Managing Queues with Heterogeneous Servers
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
Cites work
- scientific article; zbMATH DE number 977753 (Why is no real title available?)
- A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model
- A Study of Multiple Finite-Source Queueing Models
- An Optimum Repair Policy for the Machine Interference Problem
- On the optimal assignment of servers and a repairman
- On the optimal policies of an exponential machine repair problem
- Optimal policies for machine repairmen problems
- Optimal policies for scheduling repairs and allocating heterogeneous servers
- Serving process with least thinking time maximizes resource utilization
- When does the \(c\mu \) rule apply to finite-population queueing systems?
Cited in
(16)- Optimal policies for multi-server non-preemptive priority queues
- Scheduling in a single-server queue with state-dependent service rates
- Optimal revenue management in two class pre-emptive delay dependent Markovian queues
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- scientific article; zbMATH DE number 4008076 (Why is no real title available?)
- Analysis of the optimal resource allocation for a tandem queueing system
- When does the \(c\mu \) rule apply to finite-population queueing systems?
- Multiple server preemptive scheduling with impatience
- Optimal scheduling policies in time sharing service systems
- Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling
- NONPREEMPTIVE SCHEDULING OF A FINITE-SOURCE QUEUE WITH TWO CUSTOMER CLASSES
- Optimal control of a single server in a finite-population queueing network
- Scheduling services in a queuing system with impatience and setup costs
- Scheduling policies for a repair shop problem
- A 2-class maintenance model with dynamic server behavior
- Optimal service assignment in a finite-source queue
This page was built for publication: Optimal server scheduling in nonpreemptive finite-population queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877789)