86 0

(Max,+)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬 망에서 최적 버퍼 크기 결정

Title
(Max,+)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬 망에서 최적 버퍼 크기 결정
Other Titles
Determining the Optimal Buffer Sizes in Poisson Driven 3-node Tandem Queues using (Max,+)-algebra
Author
황승준
Keywords
(Max,+)-linear Systems; (Max,+)-algebra; Tandem Queues; Finite Buffers; Waiting Times
Issue Date
2007-05
Publisher
한국경영과학회
Citation
경영과학, v. 24, No. 1, Page. 25-34
Abstract
In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules : communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.
URI
http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00836730&language=ko_KRhttps://repository.hanyang.ac.kr/handle/20.500.11754/106454
ISSN
1225-1100
Appears in Collections:
COLLEGE OF BUSINESS AND ECONOMICS[E](경상대학) > BUSINESS ADMINISTRATION(경영학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE