Optimal control of bulk queues with compound Poisson arrivals and batch service (Q801614)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3879880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal control of bulk queues with compound Poisson arrivals and batch service |
scientific article; zbMATH DE number 3879880 |
Statements
Optimal control of bulk queues with compound Poisson arrivals and batch service (English)
0 references
1984
0 references
The problem of optimal control of batch service in a queue with compound Poisson arrivals is studied. The process is controlled at points in time when the server is idle and a new group of customers arrives or when a service has just been completed. One of the following procedures is taken: no customers is served; a batch consisting of all or a portion of the waiting customer is served. Costs are charged for serving the customers and for holding them in the system. It is proved that optimal policy has the form: if x customers are waiting, they all are served iff \(x>M\), where M is a constant.
0 references
semi-Markov decision process
0 references
Poisson input
0 references
optimal control of batch service
0 references
0.937915861606598
0 references
0.8835296034812927
0 references
0.853466808795929
0 references
0.845035970211029
0 references
