• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.29-46
• /
• 2007

This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.93-113
• /
• 1997

In studying an EOQ-like inventory model for a manufacturing process, a number of findings were made. The system can "go out of control" resulting in a relatively minor problem state or "break-down". When the production system is in the minor problem statei produces a number of defective items. It is assumed that each defective piece requires rework cost and related operations. Once the machine breakdown takes place, the production system produces severely defective items that are completely unusable. Each completely unusuable item is immediately discarded and incurs handling cost, scrapped raw material cost and related operations. Two investment options in improving the production process are introduced : (1) reducing the probability of machine breakdown, breakdowns, and (2) simultaneously reducing the probability of machine breakdowns and setup costs. By assuming specific forms of investment cost function, the optimal investment policies are obtained explicitly. Finally, to better understand the model in this paper, the sensitivity of these solutions to changes in parameter values and numerical examples are provided.amples are provided.

• KIEAE Journal
• /
• v.13 no.1
• /
• pp.159-165
• /
• 2013

Recently buildings are being constructed on the downtown area. In most building construction sites on the downtown area, the need for adequate material inventories are critical in order to avoid project delays and cost increases due to inappropriate deliveries of key materials. However immoderate material inventories cause increasing inventory cost. Therefore, we need a proper management material inventories. This research re-establishes the existing safety stock and analyzes relationship between safety stock and service level. It suggests an economical re-order point based on safety stock considering service level, various demand and delivery time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.95-109
• /
• 1996

In automobile industry, the depot (distribution center) system is utilized to adjust the inventory and to supply the demands to the firm timely. In case of the small lot demands of short delivery cycle and the long distance from the parts manufacturing to the firm, the depot system is very important. In this paper, a model to minimize the sum of costs of holding, inventory and transportation, is proposed to determine the optimal quantities of production and transportation in JTT system. Finally, computational results that verify the effectiveness of the proposed model are demonstrated.

• Journal of Korean Society for Quality Management
• /
• v.19 no.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.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.2
• /
• pp.137-145
• /
• 2012

본 연구는 공급자(supplier), 소매상(retailer) 그리고 고객(customer)으로 구성된 2 단계 공급사슬에서 소매상의 관점에서 소매상의 최적 재고정책 결정에 관한 문제를 다루었다. 공급자는 수요 증대를 목적으로 소매상의 주문량에 따라 다단계로 일정기간동안 제품 판매대금에 대한 지불 연기(외상)를 허용하고, 고객의 수요는 소매상의 제품 재고량에 영향을 받는다는 가정 하에 재고 모형을 설계하였다. 모형 분석을 통하여 소매상의 이익을 최대화하는 최적 주문량 결정 방법을 제시하였고, 예제를 통하여 그 제시된 해법의 타당성을 보였다.

• Korean Management Science Review
• /
• v.31 no.3
• /
• pp.13-26
• /
• 2014

This paper considers an integrated one-vendor multi-buyer production-inventory model where the vendor manufactures multiple products in lot at their associated finite production rates. In the model, it is allowed for each product to be shipped in lot to the buyers even before the whole product production is not completed yet. Each product lot is dispatched to the associated buyer in a number of shipments. The buyers consume their products at fixed rates. The objective is to the production and shipment schedules in the integrated system, which minimizes the total cost per unit time. The total cost consists of production setup cost, inventory holding cost and shipment cost. For the model, an iterative optimal solution procedure with shipment consolidation policy incorporated. It is then tested through numerical experiments to show how efficient and effective the shipment consolidation policy is.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.1
• /
• pp.107-118
• /
• 2007

It calls for positive consideration of RFID technologies applying to the operation of the optimum VMI system for decreasing safety inventory. Based on the above-said considerations, the present author judges that the introduction of RFID into the consumer goods distribution industry is one of the important issues to be settled in the future. Conclusively, this study proposes that, for the sake of the operation of VMI system, the aforesaid problems should be positively examined and efficient methods promptly developed, so as to reinforce the competitiveness of enterprises.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.4
• /
• pp.121-127
• /
• 2007

CSP(Concurrent Spare Parts) is supplied with the procurement of new equipment or weapon system and is used to sustain the equipment without resupply during the initial coverage period. This study is concerned with a problem of determining the near optimal inventory level of the spare parts, especially Concurrent Spare Parts. For this, we utilize the mixed periodic and continuous review polices considering the CSP and (r,Q) Policies concurrently in a two-echelon distribution system. We propose the mathematical model to minimize the total cost which is composed with ordering cost, purchasing cost, holding cost, and stickout cost. If the mixed policy is compared to other policies(CSP, (r,Q)), the proposed methodology performs well and is best policy in the equipment maintenance expenses.

• Korean Management Science Review
• /
• v.31 no.3
• /
• pp.61-76
• /
• 2014

There are three methods for calculating the optimal level for spare part inventories in a MIME (Multi Indenture and Multi Echelon) system : marginal analysis, Lagrangian relaxation method, and genetic algorithm. However, their solutions are sub-optimal solutions because the MIME system is neither convex nor separable by items. To be more specific, SRUs (Shop Replaceable Units) are required to fix a defected LRU (Line Replaceable Unit) because one LRU consists of several SRUs. Therefore, the level of both SRU and LRU cannot be calculated independently. Based on the limitations of three existing methods, we proposes a improved algorithm applying marginal analysis on determining LRU stock level and genetic algorithm on determining SRU stock level. It can draw optimal combinations on LRUs through separating SRUs. More, genetic algorithm enables to extend the solution search space of a SRU which is restricted in marginal analysis applying greedy algorithm. In the numerical analysis, we compare the performance of three existing methods and the proposed algorithm. The research model guarantees better results than the existing analytical methods. More, the performance variation of the proposed method is relatively low, which means one execution is enough to get the better result.