• Korean Journal of Mathematics
• /
• 제29권2호
• /
• pp.371-386
• /
• 2021

This paper investigates two discrete time queueing inventory models with positive service time and lead time. Customers arrive according to a Bernoulli process and service time and lead time follow geometric distributions. The first model under discussion based on replenishment of order upto S policy where as the second model is based on order placement by a fixed quantity Q, where Q = S - s, whenever the inventory level falls to s. We analyse this queueing systems using the matrix geometric method and derive an explicit expression for the stability condition. We obtain the steady-state behaviour of these systems and several system performance measures. The influence of various parameters on the systems performance measures and comparison on the cost analysis are also discussed through numerical example.

• 한국경영과학회지
• /
• 제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.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.93-104
• /
• 2007

We consider a supply chain where products are shipped to warehouse from manufacturing system to customers. Products are supplied from either in-house regular manufacturing or the secondary source such as subcontractor. The inventory in warehouse is controlled by base-stock policy, that is, whenever a demand arrives from customer, an order is released to the manufacturing system. Unsatisfied demand is backlogged. The manufacturing system is modeled as M/M/s+1/c queueing system, and the orders exceeding the given limit care blocked and lost. The steady state distribution of the outstanding orders and the throughput of the manufacturing system are functions of the level of engagement In the secondary source. There is a profit obtained from throughput and cost not only due to the engagement of the secondary source in the manufacturing system but also inventory positions. We want to maximize the total production profit minus the total cost of the production system by simultaneously determining the optimal level of engagement of the secondary source and the optimal base-stock level of the inventory. We develop two algorithms : one without guarantee of the optimal solution but with the small number of computations, the other optimal but with more computations.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.15-23
• /
• 1998

This paper concerns the problem of determining the spare inventory level for multi-echelon repairable-item inventory system with finite number of operating items. We consider the system which has several bases and a central depot. When an item fails, it is dispatched to a repair facility and, a spare, if available, is plugged in immediately. When the failed item is repaired, it is sent to the base and either is used to fill a backorder or is stored at a spare inventory point. Using queueing network, we develop an algorithm to find the spare inventory level which minimizes the total expected cost and, simultaneously, satisfies a specified minimum fill rate. The results of the algorithm clearly indicate that the algorithm successfully generate output with optimal solution.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.99-107
• /
• 1997

We consider a multiechelon repairable-item inventory system where several bases are supported by a central depot and the external repair facilities. Unlike METRIC- based models, there are only a finite number of repair channels at each base, central depot and the external repair facilities. It is desired to find repair capacities and spares level which together guarantee a specified service level at minimum cost. Closed queueing network theory is used to model the stochastic process. The purpose of this paper is to derive the steady-state distributions of this system.

• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.281-287
• /
• 2013

In this paper, we introduce a roots method that uses the roots inside the unit circle of the associated characteristics equation to evaluate the steady-state system-length distribution at three epochs (pre-arrival, arbitrary, and post-departure) and sojourn-time distribution in GI/PH/1 queueing model. It is very important for an air base to inspect airplane oil because low-quality oil leads to drop or breakdown of an airplane. Since airplane oil inspection is composed of several inspection steps, it sometimes causes train congestion and delay of inventory replenishments. We analyzed interarrival time and inspection (service) time of oil supply from the actual data which is given from one of the ROKAF's (Republic of Korea Air Force) bases. We found that interarrival time of oil follows a normal distribution with a small deviation, and the service time follows phase-type distribution, which was first introduced by Neuts to deal with the shortfalls of exponential distributions. Finally, we applied the GI/PH/1 queueing model to the oil train congestion problem and analyzed the distributions of the number of customers (oil trains) in the queue and their mean sojourn-time using the roots method suggested by Chaudhry for the model GI/C-MSP/1.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.267-284
• /
• 2008

Consider a supply chain where products are produced at a manufacturing system, shipped to a distribution center, and then supplied to customers. The distribution center controls inventory based on a base-stock policy, and whenever a unit of product is demanded by a customer, an order is released to the production system. Unsatisfied demand is backordered, and the inventory and backordered units are a function of the base-stock level. The manufacturing system is modeled as an M/M/s/c queueing system, and orders exceeding the limited buffer capacity are blocked and lost. The throughput of the manufacturing system and the steady state distribution of the outstanding orders are functions of number of servers and buffers of the manufacturing system. There is a profit obtained from throughput and costs due to servers and buffers of the manufacturing system, and also costs due to inventory positions of the distribution center, and we want to maximize the total production profit minus the total cost of the supply chain by simultaneously determining the optimal number of servers and buffers of the manufacturing system and the optimal base-stock level of the distribution center. We develope two algorithms, one analytical but without guarantee of the optimal solution and one optimal but without complete analytical proofs. The problem integrates strategic problem of the manufacturing system with tactical problem of the distribution center in a supply chain.

• 대한산업공학회지
• /
• 제28권1호
• /
• pp.1-13
• /
• 2002

We study a multi-component production/inventory system in which individual components are made to meet various demand types. We assume that the demands arrive according to a Poisson process, but there is a fixed probability that a demand requests a particular kit of different components. Each component is produced by a flow line with several stations. The production of each component is operated by the CONWIP control mechanism. To analyse this system, we propose an approximation method based on aggregation method. In application of the aggregation method, a product-form approximation technique as well as a matrix-geometric method is used. Comparisons with simulation show that the approximation method provides fairly good results.

• 산업경영시스템학회지
• /
• 제13권22호
• /
• pp.17-24
• /
• 1990

The inventory problem of the repairable items is modeled as a queueing network for the purpose of determining the number of spares in a multi-echelon repair system subject to stochastic failure. In this paper, we are considering a finite number of repairman at each base and the depot. After repair job has completed, the repaired items are returned to the base where they have originated. For the system, we identify the distribution of the total number of failed items which belongs to a base and develope a method to find spare inventory levels of the repairable items at each base to satisfy a specified minimum fill rate.

• 품질경영학회지
• /
• 제19권1호
• /
• pp.129-140
• /
• 1991

This paper deals with on (S-1, S) spare-part inventory model for multi-stage machine repair problem with attrition. The steady-state availability of the system is maximized under some constraints such as total cost, available space etc.. The problem is formulated as a closed queueing network and the system availability is calculated by Buzen's computational algorithm. In order to find the optimal numbers of spare units and repair channels for each operating stage, the problem is formulated as a non-linear integer programming(NLIP) problem and an efficient algorithm. which is a natural extension of the new Lawler-Bell algorithm of Sasaki et el., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.