Analysis of discrete-time batch-service queueing systems이산시간 집단서비스 대기행렬시스템의 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 594
  • Download : 0
In this dissertation, we consider a discrete-time single-server queueing system having finite buffer capacity and a Bernoulli arrival process. The system has a finite number M of waiting places and a batch service random capacity Y. A service period is initialized when a service-starting threshold \``a\`` of waiting customers is reached. The system is denoted accordingly by $Geo/G^{a,Y}/1/M$. This queueing system is motivated by manufacturing environments with batch service workstations, e.g., in machines for computer components and chip productions. We first derive departure-epoch probabilities using the embedded Markov chain technique. Next, we establish two relationships for the steady-state probabilities of the queue lengths at two epochs: departure and random. These relationships for the steady-state probabilities at two different epochs can be implemented for numerical computations and useful performance measures such as the loss probability can be obtained. As this queueing system can be potentially useful in various other field such as production, transportation, traffic processes and various related systems, the results in this thesis would be useful not only to queueing researchers but also to practitioners who wish to evaluate the performance of their real systems. Further, many of the analytical and computational results of batch service queueing systems can now be recast in this framework. Moreover, the approach used in this thesis seems to be applicable to a much wider range of queueing systems with more general batch arrival and batch service. This dissertation also presents an exact analysis of the steady-state queue-length distribution of the Geo/G/1 queue with disasters which remove all workloads from the system whenever they occur. We first present the steady-state queue-length distribution of the Geo/G/1 queue with disasters. Then, by using this result, we analyze the Geo/G/1 queue with multiple working vacations in which the server wor...
Advisors
Chae, Kyung-Chulresearcher채경철researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2006
Identifier
258101/325007  / 020035228
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업공학과, 2006.8, [ iv, 94 p. ]

Keywords

집단서비스; 유한용량; 이산시간; multiple working vacation; disaster; queue length; finite waiting capacity; variable service capacity; 고객수; discrete time; batch service

URI
http://hdl.handle.net/10203/40602
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=258101&flag=dissertation
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0