• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.99-109
• /
• 2004

In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.15-26
• /
• 2000

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value k. Customers arriving at the queueing network when there are more than k customers are forced to walt in an external queue. The arrival process to the queueing network is assumed to be arbitrary. It is known that the queueing network with population constrant and constant service times can be transformed into a simple network involving only two nodes. In this paper, the departure process from the queueing network is examined using this simple network. An approximation can be calculated with accuracy. Finally, validations against simulation data establish the tightness of these.

• The Journal of Fisheries Business Administration
• /
• v.30 no.2
• /
• pp.25-37
• /
• 1999

Some multi echelon inventory systems carry perishable products. The value of these product reduces as the period of time they spend in the system. In this paper We derive the necessary condition to determine optimal quantity, service level for a perishable product. The systems considered consist of two echelons and carry single item. To determine the optimal order quantity, the demand is assumed to be constant, the holding costs may be different in the echelons, and it allows no shortages. I assumed the price of product decreases by negative exponential function. To determine service level, following assumptions used in the model ㆍlead time is constant. ㆍdemand is normal distribution. ㆍthe product starts to perish at the second echelon. Service level is computed for different levels of lead times and for different variance of demands and for different price functions. The experimental results indicate that the service level in cost is a function of service level in demand and perishability of product. Results of the models exhibit that perishability and the age of the product are critical to determine the lot sizing and service level.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.4
• /
• pp.113-121
• /
• 2009

In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.21-30
• /
• 1997

This research fundamentally deals with an analysis of service level for a multi-level inventory distribution system which is consisted of a central distribution center and several branches being supplied stocks from the distribution center, Under continuous review policy, the distribution center places an order for planned order quantity to an outside supplier, and the order quantity is received after a certain lead time. Also, each branch places an order for particular quantity to its distribution center, and receives the order quantity after a lead time. In most practical distribution environment, demands and lead times are generally not fixed or constant, but variable. And these variabilities make the analysis more complicated. Thus, the main objective of this research is to suggest a method to compute the service level at each depot, that is, the distribution center and each branch with variable demands and variable lead times. Further, the model will give an idea to keep the proper level of safety stocks that can attain effective or expected service level for each depot.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.3
• /
• pp.65-75
• /
• 2001

This research fundamentally deals with an analysis of service level for a multi-level inventory distribution system which is consisted of a central distribution center and several branches being supplied stocks from the distribution center, Under continuous review policy, the distribution center places an order for planned order quantity to an outside supplier, and the order quantity is received after a certain lead time. Also, each branch places an order for particular quantity to its distribution center, and receives the order quantity after a lead time. In most practical distribution environment, demands and lead times are generally not fixed or constant, but variable. And these variabilities make the analysis more complicated. Thus, the main objective of this research is to suggest a method to compute the service level at each depot, that is, the distribution center and each branch with variable demands and variable lead times. Further, the model will give an idea to keep the proper level of safety stocks that can attain effective or expected service level for each depot.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

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.

• Transactions of the KSME C: Technology and Education
• /
• v.1 no.1
• /
• pp.129-138
• /
• 2013

Constant airflow should be kept in order to operate a constant-fired boiler of thermal power plants. Main Bearing Assembly Unit which rotates the ventilation fan does very important role to maintain constant airflow. However, the demand to the output of power is getting increased while the quality level of coal is getting worse than the initial level of design criteria. Especially cost wise operation considering increasing output and the difficulty to supply good quality coal drive increasing supply of low quality coal. As a result, the service life of Main Bearing Assembly is getting shorter till 2~3 years which is just a half of the life of original design. In this study, what causes to shorten the service life of Main Bearing Assembly Unit is analyzed through the reverse engineering and analysis and how to improve the service life more than two times to current situation is explained.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.119-129
• /
• 2019

Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.