Some Optimization Problems with Bulk‐Service Queues | Zendy

Barnett Arnold | Zendy; Kleitman Daniel J. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Some Optimization Problems with Bulk‐Service Queues

Author(s) -

Barnett Arnold,

Kleitman Daniel J.

Publication year - 1978

Publication title -

studies in applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 46

eISSN - 1467-9590

pISSN - 0022-2526

DOI - 10.1002/sapm1978583277

Subject(s) - queue , complement (music) , probabilistic logic , mathematical optimization , dynamic programming , service (business) , computer science , optimal control , optimization problem , mathematics , computer network , artificial intelligence , complementation , economics , gene , phenotype , biochemistry , chemistry , economy

An optimal control problem for a single bulk‐service queue is considered. Theorems that characterize the optimal control strategy in some circumstances are proved; they complement earlier results by Deb and Serfozo for a comparable problem. Most of the analysis uses direct probabilistic reasoning rather than specialized methods such as dynamic programming. Some illustrative examples are presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research