Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station
碩士 === 國立中興大學 === 應用數學研究所 === 82 === This thesis studies the optimal control N-policy of a removable service station in an M/Eκ/1 queueing systems with infinite and finite capacities, respectively, under steady-state conditions. The N-polic...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
1994
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51079283497826764912 |
id |
ndltd-TW-082NCHU0507017 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-082NCHU05070172015-10-13T15:33:32Z http://ndltd.ncl.edu.tw/handle/51079283497826764912 Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station M/Eκ/1排隊系統含有可移動服務站之最佳控制 Hui-Mei Huang 黃惠美 碩士 國立中興大學 應用數學研究所 82 This thesis studies the optimal control N-policy of a removable service station in an M/Eκ/1 queueing systems with infinite and finite capacities, respectively, under steady-state conditions. The N-policy is to turn the service station on when the queue size reaches N which is a positive integer, and turn it off when the system is empty. We develop the steady-state characteristics of the infinite capacity and finite capacity systems such as the probability distributions of the number of customers in the system, the expected number of customers in the system, and so on. The controllable M/Eκ/1 queueing system generalizes the ordinary M/M/1 queueing system, the ordinary M/E κ/1 queueing system, and the controllable M/M/1 queueing system. We derive the total expected cost functions per unit time, and determine the optimal value of the control parameter N, say N*, in order to minimize the cost functions for these two systems. Kuo-Hsiung Wang 王國雄 1994 學位論文 ; thesis 36 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中興大學 === 應用數學研究所 === 82 === This thesis studies the optimal control N-policy of a removable
service station in an M/Eκ/1 queueing systems with infinite
and finite capacities, respectively, under steady-state
conditions. The N-policy is to turn the service station on when
the queue size reaches N which is a positive integer, and turn
it off when the system is empty. We develop the steady-state
characteristics of the infinite capacity and finite capacity
systems such as the probability distributions of the number of
customers in the system, the expected number of customers in
the system, and so on. The controllable M/Eκ/1 queueing system
generalizes the ordinary M/M/1 queueing system, the ordinary M/E
κ/1 queueing system, and the controllable M/M/1 queueing
system. We derive the total expected cost functions per unit
time, and determine the optimal value of the control parameter
N, say N*, in order to minimize the cost functions for these
two systems.
|
author2 |
Kuo-Hsiung Wang |
author_facet |
Kuo-Hsiung Wang Hui-Mei Huang 黃惠美 |
author |
Hui-Mei Huang 黃惠美 |
spellingShingle |
Hui-Mei Huang 黃惠美 Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
author_sort |
Hui-Mei Huang |
title |
Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
title_short |
Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
title_full |
Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
title_fullStr |
Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
title_full_unstemmed |
Optimal Control of an M/Eκ/1 Queueing System with Removable Service Station |
title_sort |
optimal control of an m/eκ/1 queueing system with removable service station |
publishDate |
1994 |
url |
http://ndltd.ncl.edu.tw/handle/51079283497826764912 |
work_keys_str_mv |
AT huimeihuang optimalcontrolofanmek1queueingsystemwithremovableservicestation AT huánghuìměi optimalcontrolofanmek1queueingsystemwithremovableservicestation AT huimeihuang mek1páiduìxìtǒnghányǒukěyídòngfúwùzhànzhīzuìjiākòngzhì AT huánghuìměi mek1páiduìxìtǒnghányǒukěyídòngfúwùzhànzhīzuìjiākòngzhì |
_version_ |
1717766655376883712 |