• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1999.10a
• /
• pp.83-90
• /
• 1999

Centralized safety stock in a periodic replenishment system which consists of one central warehouse and m regional warehouse can reduce backorders allocation the centralized safety stocks to regional warehouse in a certain instant of each replenishment cycle. If the central warehouse can not monitoring inventories in the regional warehouse, then we have to predetermine the instant of allocation according to demand distribution and this instant must be same for all different replenishment cycle. However, transition of inventory level in each cycle need not to be same, and therefore different instant of the allocation may results reduced shortage compare to the predetermined instant of allocation. In this research, we construct a dynamic model based on the assumption of monitoring inventories inventories in the regional warehouse everyday, and develop an algorithm minimize shortage in each replenishment cycle using dynamic programming approach.

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

The main objective of this research is to develop a model to select the optimal input service level for a distribution center - multi branch inventory distribution system. With the continuous review policy, the distribution center places an order for specific order quantity to an outside supplier, and the order quantity is replenished after a certain lead time. Also, each branch places an order for particular order quantity to the distribution center to satisfy the customer demands, and receives the replenishment after a lead time. When an out of stock condition occurs during an order cycle, a backorder is placed to the upper level to fill the unfilled demands. With these situation, variable demand and variable lead time are used for better industrial practice. Further, actual lead times with a generic lead time distribution are used in developing the control model. Under the actual lead time model, the customer service measures actually attained for the distribution center and each branch are explained as the effective customer service measures. Thus, throughout the optimal control (using computer search procedures), we can select the optimal input service levels for the distribution center and each branch to attain the effective service level for each branch which is consistent with the goal level of service for each branch. At the same time, the entire distribution system keeps minimum inventories.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.477-480
• /
• 1996

The main objective of this research is to develop the optimal control method for a Distribution Center - multi Branch inventory distribution system. With the continuous review policy, the distribution center places an order for specific order quantity to an outside supplier, and the order quantity is replenished after a certain lead time. Also, each branch places an order for particular order quantity to the distribution center to satisfy the customer demands, and receives the replenishment after a lead time. When an out of stock condition occurs during an order cycle, a backorder is placed to the upper level to fill the unfilled demands. With these situation, variable demand and variable lead time are used for better industrial practice. Futher, actual lead times with a generic lead time distribution are used in developing the control model. Under the actual lead time model, the customer service measures actually attained for the distribution center and each branch are explained as the effective customer service measures. Thus, throughout the optimal control (using computer search procedures), we can set the desired service levels for the distribution center and each branch to produce the effective service level for each branch which is consistent with the goal level of service for each branch. At the same time, the entire distribution system keeps minimum inventories.

• Korean Management Science Review
• /
• v.29 no.3
• /
• pp.121-134
• /
• 2012

In this study, we consider a component procurement planning problem where the procurement amounts of components are determined under assemble-to-order systems with demand uncertainty. In the problem, procurement amount of each component is decided before the demands of finished products are known and after the demands are identified the assembly amounts of the finished products are decided. In this study, the objective function of the problem is minimizing the total costs which are composed of purchase and inventory costs of the components and the backorder costs of the finished products. We assume that the uncertain demand information is given as multiple scenarios of the demands, and we propose procurement planning methods based on stochastic models which considering the multiple demand scenarios. To evaluate the performances of the proposed methods, computational experiments were carried out on the proposed methods as well as benchmarks including a method based on deterministic mathematical model and a heuristic. From the results of the computational tests, the superiorities of the proposed methods were shown.

• Korean Management Science Review
• /
• v.31 no.2
• /
• pp.1-13
• /
• 2014

In almost all of the organizations, the cost for acquiring and maintaining the inventory takes a considerable portion of the management budget, and thus a certain constraint is set upon the budget itself. The previous studies on inventory control for each item that aimed to improve the fill rate, backorder, and the expenditure on inventory are fitting for the commercially-operated SCM, but show some discrepancies when they are applied to the spare parts for repairing disabled systems. Therefore, many studies on systematic approach concept considering spare parts of various kinds simultaneously have been conducted to achieve effective performance for the inventory control at a lower cost, and primarily, METRIC series models can be named. However, the past studies were limited when dealing with the probability distributions for representing the situation on demand and transportation of the parts, with the (S-1, S) inventory control policy, and so on. To address these shortcomings, the Continuous Time Markov Chain (CTMC) model, which considers the phase-type distributions and the (s, Q) inventory control policies to best describe the real-world situations inclusively, is presented in this study. Additionally, by considering the cost versus the system availability, the optimization of the inventory level, based on this model, is also covered.

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

The main objective of this research is to develop a model to select the optimal input service level for a distribution center-multi branch inventory distribution system. With the continuous review policy, the distribution center places an order for specific order quantity to an outside supplier, and the order quantity is replenished after a certain lead time Also, each branch places an order for particular order quantity to the distribution center to satisfy the customer demands, and receives the replenishment after a lead time. When an out of stock condition occurs during an order cycle, a backorder is placed to the upper level to fill the unfilled demands. With these situation, variable demand and variable lead time are used for better industrial practice. Further, actual lead times with a generic lead time distribution are used in developing the control model. Under the actual lead time model, the customer service measures actually attained for the distribution center and each branch are explained as the effective customer service measures. Thus, throughout the optimal control (using computer search procedures), we can select the optimal input service levels for the distribution center and each branch to attain the effective service levels for each branch which is consistent with the goal level of service for each branch. At the same time, the entire distribution system keeps minimum inventories.

• IE interfaces
• /
• v.19 no.2
• /
• pp.124-132
• /
• 2006

The system under study is a single item, multi-echelon distribution system with a capacitated production facility. All the nodes at the downstream ends are demand-sites, i.e., ordered items are delivered to the customers from the node. Also any transshipment depots in the midstream can be demand-sites as well. For a given planning period, at each of demand-site, demand is forecasted and known. Our objective is to minimize the average system cost per period which is the sum of holding and backorder costs in the entire network. Due to the capacity restrictions, it is difficult to establish efficient distribution planning. To overcome such a difficulty and obtain a reasonable and better solution, we convert this problem into a single machine earliness and weighted tardiness scheduling. We propose a simple but cost-effective heuristic for this problem. The experimental results showed that the proposed heuristic obtained much better solutions compared with another approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.27-46
• /
• 1992

This paper considers an (r, Q) policy for operation of a multipurpose facility. It is assumed that whenever the inventory level falls below r, the model starts to produce the fixed amount of Q. The facility can be utilized for extra production during idle periods, that is, when the inventory level is still greater than r right after a main production operation is terminated or an extra production operation is finished. But, whenever the facility is in operation for an extra production, the operation can not be terminated for the main production even though the inventory level falls below r. In the model, the demand for the product is assumed to arrive according to a compound Poisson process and the processing time required to produce a product is assumed to follow an arbitary distribution. Similarly, the orders for the extra production is assumed to accur in a Poisson process are the extra production processing time is assumed to follow an arbitrary distribution. It is further assumed that unsatisfied demands are backordered and the expected comulative amount of demands is less than that of production during each production period. Under a cost structure which includes a setup/ production cost, a linear holding cost, a linear backorder cost, a linear extra production lost sale cost, and a linear extra production profit, an expression for the expected cost per unit time for a given (r, Q) policy is obtained, and using a convex property of the cost function, a procedure to find the optimal (r, Q) policy is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.185-205
• /
• 2002

In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. Under these situations, the ultimate objective of this study is to prove the variability propagation principle in a pull serial line and is to measure it in terms of the first two moments of the inter-departure process subject to number of cards in each cell. Two preparations are required to achieve this objective : The one is to derive a true lower bound of variance of the inter-departure process. The other is to establish a constrained discrete minimax problem for the no backorder (backlogging) probabilities in each cell. We may get some fundamental results necessary to a completion for the proof through the necessary and sufficient conditions for existence of optimal solution of a constrained discrete minimax problem and the implicit function theorem. finally, we propose a numeric model to measure the variability propagation principle. Numeric examples show the validity and applicability of our study.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.1-12
• /
• 2012

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.