Abstract
We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).
Original language | English |
---|---|
Pages (from-to) | 257-262 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 42 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2014 Jun |
Bibliographical note
Funding Information:B. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) ( 2011-0025576 ). J. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ).
Keywords
- Admission control
- Greedy policy
- Optimal policy
- Prudent policy
- Tandem queues
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics