Continuous time control of the arrival process in an M/G/1 queue
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 3447908 (Why is no real title available?)
- scientific article; zbMATH DE number 3205068 (Why is no real title available?)
- scientific article; zbMATH DE number 3205069 (Why is no real title available?)
- scientific article; zbMATH DE number 3212585 (Why is no real title available?)
- A Combinatorial Method in the Theory of Queues
- A Queueing Reward System with Several Customer Classes
- An Optimal Rejection Time for an M/G/1 Queuing System
- Continuous time control of Markov processes on an arbitrary state space: Discounted rewards
- Customers' Optimal Joining Rules for the GI/M/s Queue
- Markov-Renewal Programming. I: Formulation, Finite Return Models
- On (s, S) Policies
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
- The Streetwalker’s Dilemma: A Job Shop Model
Cited in
(3)
This page was built for publication: Continuous time control of the arrival process in an M/G/1 queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243969)