| dc.contributor | 應數系 | en_US |
| dc.creator (作者) | 陸行 | zh_TW |
| dc.creator (作者) | Luh,Hsing | en_US |
| dc.creator (作者) | Huang,Chun-Lian | en_US |
| dc.date (日期) | 2005 | en_US |
| dc.date.accessioned | 5-Aug-2014 17:03:54 (UTC+8) | - |
| dc.date.available | 5-Aug-2014 17:03:54 (UTC+8) | - |
| dc.date.issued (上傳時間) | 5-Aug-2014 17:03:54 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/68188 | - |
| dc.description.abstract (摘要) | We consider a queueing system with two stations in series. Assume the service time distributions are general at one station and a finite mixture of Erlang distributions at the other. Exogenous customers should snatch tokens at a token buffer of finite capacity in order to enter the system. Customers are lost if there are no tokens available in the token buffer while they arrive. To obtain the stationary probability distribution of number of customers in the system, we construct an embedded Markov chain at the departure times. The solution is solved analytically and its analysis is extended to semi-Markovian representation of performance measures in queueing networks. A formula of the loss probability is derived to describe the probability of an arriving customer who finds no token in the token buffer, by which the throughput and the optimal number of tokens are also studied. | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Quality Technology and Quantitative Management,2(1),109-121 | en_US |
| dc.subject (關鍵詞) | Embedded Markov chains;probability distributions;queueing networks | en_US |
| dc.title (題名) | Optimal Capacities of Tokens at Tandem-Queue Models of General Service Times | en_US |
| dc.type (資料類型) | article | en |
