A Queueing Reward System with Several Customer Classes
From MaRDI portal
Cited in
(35)- Optimal admission and pricing control problem with deterministic service times and sideline profit
- On the optimal control of a single-server queueing system: Further remarks
- Continuous time control of the arrival process in an M/G/1 queue
- Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Exponential penalty function control of loss networks
- Optimal patient and personnel scheduling policies for care-at-home service facilities
- Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems
- Optimal admission control in two-class preemptive loss systems
- Bias optimality of admission control in a non-stationary repairable queue
- Optimal strategies for managing complex authentication systems
- Queueing theory
- Optimality of admission control in a repairable queue
- Admission control in a two-class loss system with periodically varying parameters and abandonments
- Admit or preserve? Addressing server failures in cloud computing task management
- Optimal pricing for a \(\mathrm{GI}/\mathrm{M}/k/N\) queue with several customer types and holding costs
- On the optimality of a maintenance queueing system
- Individual, Class-Based, and Social Optimal Admission Policies in Two-Priority Queues
- CUSTOMER SELECTION PROBLEM WITH SEARCH COST, DUE DATE, SIDELINE PROFIT, AND NO WAITING ROOM
- Optimal order-selection policies for a job shop production system
- A Priority Queue with General Bulk Service
- On equilibrium analysis of acyclic multiclass loss networks under admission control
- Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels
- Two-class routing with admission control and strict priorities
- Admission and Termination Control of a Two Class Loss System
- Optimality of admission control in an M/M/1/N queue with varying services
- Optimal admission and routing with congestion-sensitive customer classes
- Dynamic admission control for loss systems with batch arrivals
- Optimality of randomized trunk reservation for a problem with a single constraint
- Logarithmic regret bounds for continuous-time average-reward Markov decision processes
- Approximate Linear programming for a queueing control problem
- Admission control with batch arrivals.
- Admission control for service systems with impatient customers: value of information
- Customer selection problem with profit from a sideline
- Revenue management for a make-to-order company with limited inventory capacity
This page was built for publication: A Queueing Reward System with Several Customer Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580082)
