• 대한산업공학회지
• /
• 제21권2호
• /
• pp.153-165
• /
• 1995

Many closed queueing network models have been used as an effective tool to make a preliminary design of FMS. Although a loading/unloading function is an important factor to effect the utilization and throughput of FMS as well as a transfer function and a processing function, the Solberg's model did not clarify the loading/unloading function. In this paper, we propose a closed queueing network model for analyzing a flexible manufacturing system that consists of a load/unload station, a material handling system and a group of workstations for processing jobs, and define the expected utilization and the expected throughput of the FMS. As applications of the proposed model, the cases of a material handling system consisting of a conveyor and the FMS including an inspection station are also formulated.

• 한국국방경영분석학회지
• /
• 제6권2호
• /
• pp.47-67
• /
• 1980

Interactions of major activities participating in fleet operations are investigated in the framework of a closed queueing network system with finite aircrafts assigned to it. An implementable algorithm is developed, which is useful for computing the distributions needed to evaluate the effects of the interactions on the fleet operations. The availability management program is focused on seeking an optimal resource allocation to multiple repair-shops to maximize the fleet availability subject to the budget constraint.

• 한국경영과학회지
• /
• 제28권1호
• /
• pp.37-49
• /
• 2003

Using the concept of closed queueing network, we present a consistent way of interpreting existing duality relations among queueing systems. Also, using embedded Markov chains, we present a few new duality relations for the queueing systems with negative customers.

• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.114-120
• /
• 2005

This paper studies procedures for bottleneck detection in closed queueing networks(CQN's) with multiple job classes. Bottlenecks refer to servers operating at $100\%$ utilization. For CQN's, this can occur as the population sizes approach infinity. Bottleneck detection reduces to a non-linear complementary problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are provided.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.27-44
• /
• 2000

In this study we consider a spares provisioning problem for repairable items in which a parts inventory system is incorporated. If a machine fails, a replacement part must be obtained at the parts inventory system before the failed machine enters the repair center. The inventory policy adopted at the parts inventory system is the (S, Q) policy. Operating times of the machine before failure, ordering lead times and repair times are assumed to follow a two-stage Coxian distribution. For this system, we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of machines at each station and the probability that a part will wait at the parts inventory system. For the analysis of the proposed system, we model the system as a closed queueing network and analyze it using a product-form approximation method. A recursive technique as well as an iterative procedure is used to analyze the sub-network. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.63-79
• /
• 2006

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied immediately are either backordered or lost according to the number of demands that exist at their arrival Instants. For this system we develop an approximation method to calculate performance measures such as steady state probabilities of the number of parts at each station, proportion of lost demands and the mean number of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation show that the approximation method provides fairly good results.

• 정보처리학회논문지A
• /
• 제9A권1호
• /
• pp.45-52
• /
• 2002

본 논문에서는 네트워크환경에 따라 모호성을 갖는 집중형 분산처리시스템의 성능평가를 위해 퍼지이론을 적용한 퍼지 폐쇄형 BCMP 큐잉네트워크모델을 제안하였다. 이 모델은 퍼지요소들을 처리할 수 있는 퍼지평균값분석방법을 사용하여 작업소요시간, 시스템처리율, 시스템내 작업수 및 서버 활용율 등의 시스템 성능을 평가할 수 있는 측도를 유도하였다. 이들의 유효함을 검증하기 위하여 퍼지서비스요구시간을 갖는 집중형 분산 처리시스템에 클라이언트의 수의 변화에 따른 유도된 성능평가측도를 시뮬레이션하고, 그 결과를 고찰하였다. 제안된 모델은 모호성을 갖는 시스템의 성능을 평가할 때 기존의 방법보다 유연하고 실제적인 방법을 제공한다.

• 산업경영시스템학회지
• /
• 제17권32호
• /
• pp.53-62
• /
• 1994

This paper deals with the analysis of the PC communication service system performance which will be installed as a gateway between PSTN and PSDN. Firstly, we classify the data traffic pattern into interactive, conversational, and file transfer type from the actual statistics. Secondly, we model the system structure as a closed queueing network model with multiservers and multiple customer classes and derive the analytic method to be able to measure the system performance using Mean Value Analysis. Finally, the simulation results indicate that the analytic method obtained is a good approximation method to measure the system performance of the PC communication service system as a gateway between PSTN and PSDN.

• 대한산업공학회지
• /
• 제22권1호
• /
• pp.3-15
• /
• 1996

An approximation algorithm is presented for cyclic queueing networks with finite buffers. The algorithm decomposes the queueing network into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process reflects the additional delay a unit might undergo due to blocking and the arrival process is described by a 2-phases Coxian ($C_2$) distribution. The individual queues are modelled as $C_2/C_2$/1/B queues. The parameters of the individual queues are computed approximately using an iterative scheme. The population constraint of the closed network is taken into account by ensuring that the sum of the average queue lengths of the individual queues is equal to the number of customers of the network. Extensive numerical experiments show that this method provides a fairly good estimation of the throughput.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.89-102
• /
• 2000

In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.