Control policy of a hysteretic queueing system.
Saved in:
| Title: | Control policy of a hysteretic queueing system. |
|---|---|
| Authors: | Tadj, Lotfi, Ke, Jau-Chuan |
| Source: | Mathematical Methods of Operations Research. 2003, Vol. 57 Issue 3, p367. 10p. |
| Subjects: | Queuing theory, Control theory (Engineering), Markov processes, Operations research, Mathematics |
| Abstract: | This paper is concerned with the optimal control of a bulk service queueing system under N-policy. If the number of customers in the system at a service completion is larger than some integer r, then the server starts processing a group of r customers. If, on the other hand, it is smaller than r, then the server goes through an idle period and waits for the line to grow up to some integer N (N ≥ r). We present some system characteristics by means of the embedded Markov chains and semi-regenerative techniques. We also construct the expected total cost for this model and develop a procedure to determine the optimal thresholds r and N that yield the minimum cost. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematical Methods of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
