G/M/1 queue with server hyperexponential vacationHyper-exponential 휴가시간을 갖는 G/M/1 대기체계
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Choi, Bong-Dae | - |
| dc.contributor.advisor | 최봉대 | - |
| dc.contributor.author | Choi, Doo-Il | - |
| dc.contributor.author | 최두일 | - |
| dc.date.accessioned | 2011-12-14T04:58:50Z | - |
| dc.date.available | 2011-12-14T04:58:50Z | - |
| dc.date.issued | 1991 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67670&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/42349 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수학과, 1991.2, [ [ii], 25 p. ; ] | - |
| dc.description.abstract | In this paper, we consider the G/M/1 queue with multiple vacation and exhaustive service discipline where the vacation time has n stages hyperexponential distribution. For this model, By using the methods of the shift operater and supplementary variable, we obtain the queue length probabilities at arrival time points and arbitrary time points simultaneously. In addition, we show that our results for n=1 reduce to the corresponding known results obtained by imbedded Markob chain approach. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | G/M/1 queue with server hyperexponential vacation | - |
| dc.title.alternative | Hyper-exponential 휴가시간을 갖는 G/M/1 대기체계 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 67670/325007 | - |
| dc.description.department | 한국과학기술원 : 수학과, | - |
| dc.identifier.uid | 000891500 | - |
| dc.contributor.localauthor | Choi, Bong-Dae | - |
| dc.contributor.localauthor | 최봉대 | - |
- Appears in Collection
- MA-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.