• 제목/요약/키워드: Inventory Constraint

검색결과 42건 처리시간 0.027초

시스템 가용도를 고려한 수리부품의 재고수준 최적화 (Optimization for Inventory Level of Spare Parts Considering System Availability)

  • 김흥섭;김판수
    • 경영과학
    • /
    • 제31권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.

다품종 예산제약을 고려한 중앙창고문제 해결방법론에 대한 연구 (A Study on A Methodology for Centralized Warehouse Problem Considering Multi-item and Budget Constraint)

  • 이동주
    • 산업경영시스템학회지
    • /
    • 제35권4호
    • /
    • pp.126-132
    • /
    • 2012
  • This paper deals with a centralized warehouse problem with multi-item and capacity constraint. The objective of this paper is to decide the number and location of centralized warehouses and determineorder quantity (Q), reorder point (r) of each centralized warehouse to minimize holding, setup, penalty, and transportation costs. Each centralized warehouse uses continuous review inventory policy and its budget is limited. A SA (Simulated Annealing) approach is developed and its performance is tested by using some computational experiments.

Applying Theory of Constraint on Logistic Management in Large Scale Construction Sites - A Case Study of Steel Bar in TFT-LCD Factory Build-Up

  • Huang, Chih-Yao;Chen, Ching-Piao;Li, Rong-Kwei;Tsai, Chih-Hung
    • International Journal of Quality Innovation
    • /
    • 제9권1호
    • /
    • pp.68-93
    • /
    • 2008
  • The steel bars account for a high percentage of material costs for the current construction projects. At the present time, most of the construction projects for the factories of thin-film transistor liquid crystal display (TFT-LCD) complete the transactions of steel bars when the suppliers ship the steel bars to the temporary storage/processing sites. This paper applies the buy-in concept in the Theory of Constraint (TOC) on the supply chain of steel bars. In this study, suppliers are required to establish warehouses at the construction sites and complete the transactions when the formed and processed steel bars are shipped into the factory sites. The aim is to find a win-win solution to meet with the expectations from constructors as they hope that there is no need to build up inventories but supply is ready at any time. Also, this paper compares and analyzes the traditional supply/inventory model of steel bars and the Demand-Pull (D-P) model under the TOC framework. It is proved that Vendor Management Inventory (VMI) in the D-P model is able to more effectively manage steel bars as a material.

ERP 시스템 도입과정에서 생산시스템 설계방안 (Manufacturing System Design on the Introduction of ERP System)

  • 양광모;박재현;강경식
    • 대한안전경영과학회지
    • /
    • 제4권1호
    • /
    • pp.105-114
    • /
    • 2002
  • Nowadays, most companies seek after the greatest profit by means of offering the goods which consumers want timely and efficiently and minimizing the cost of inventory and distribution channel which amounts to the great portion of total cost. And according as EC(Electronic Commerce) market has increased rapidly, SCM(Supply Chain Management) for EC become one of the most important facts for companies, therefore this paper suggest SCM scheme which EC, especially B to C, is added to the existing commerce system. This paper uses internet for information integration of distribution channel which is away from one another and applies TOC(Theory of Constraint)'s DBR(Drum-Buffer-Rope) Scheduling for synchronization through the whole supply chain. It is possible to synchronize the whole supply chain by means of making the speed of manufacturing and distribution to be controlled by consumer's order which is received in distribution center, and inventory and loss of sales opportunities are minimized by constant. Buffer Management. If inventories in distribution center is short, then it needs to search CCR(Capacity Constraint Resource) in supply chain and to control the speed of manufacturing and distribution according to the ability of CCR. This paper applies PT(Partial Transshipment) strategy for Delivery from distribution center to store or cyber consumer. the strategy this paper suggests chooses neighbour area from area which each distribution center takes charge, and then makes product ordered by cyber consumer which lives in the chosen area to be delivered according to inventory of distribution center.

수리용량의 제한이 있는 수리가능한 부품의 3단계 재고시스템에 관한 연구 (A Three-Echelon Inventory Model for Repairable Items with Capacity Constraint)

  • 김지승
    • 산업경영시스템학회지
    • /
    • 제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.

  • PDF

유한 공급 능력을 보유한 공급자의 재고 및 가격정책 모형 (Static Model for Simultaneous Decision Making on Inventory and Pricing Polices for Capacity-Constrained Supplier)

  • 이경근;김영석
    • 대한산업공학회지
    • /
    • 제22권4호
    • /
    • pp.677-687
    • /
    • 1996
  • We study simultaneous decision making model for a monopolistic or competitive supplier to decide inventory and pricing policies under capacity constraint. Economic implications are obtained from the optimality conditions such as production lot sizes, pricing schedules and so on. Sensitivity analysis gives us the optimal relations among the critical economic quantities.

  • PDF

판매자와 구매자의 재고상한이 존재하는 VMI (VMI with Upper Limit of Inventory for Vendor and Retailer)

  • 이동주
    • 산업경영시스템학회지
    • /
    • 제40권4호
    • /
    • pp.105-111
    • /
    • 2017
  • Vendor Managed Inventory is a well-known vendor-retailer coordination approach in supply chain management where the vendor manages inventory of the retailer and determines the order interval and order quantity for the retailer. To consider practical situation, the upper limit of inventory for the retailer is set. If the inventory level for the retailer exceeds the upper limit, then the penalty cost is charged to the retailer. Furthermore, maximum allowable inventory level is set for the vendor to prevent the vendor from keeping much inventory. Single-vendor multi-retailer supply chain model with upper limit of inventory for vendor and retailers is studied. All the retailers' are assumed to have the common cycle time, and a vendor manages retailers' inventory and replenishes products. The mathematical formulation is introduced to minimize the total cost including the penalty cost violating the upper limit of inventory for retailers with the constraint of maximum allowable inventory level. The solution procedure based on Karush-Kuhn-Tucker (KKT) conditions is derived. KKT conditions are often applied to find an optimal solution of nonlinear programming problem with constraints. An illustrative example is used to show the application of the proposed solution procedure. Furthermore, sensitivity analysis is done to find out the relationship between maximum allowable inventory level and other values such as order quantity, the number of shipment, vendor's cost, retailer's cost, and total cost. As maximum allowable inventory level decreases, the number of shipment decreases but total cost increases. Order quantity has the trend of decline and is affected by the number of shipment.

2단계 시리얼 시스템의 Fill Rate 만족 방안 (Two-stage Serial Supply Chains under Fill Rate Constraints)

  • 권익현;김성식
    • 한국경영과학회지
    • /
    • 제31권1호
    • /
    • pp.105-115
    • /
    • 2006
  • In this paper, we investigate the problem of minimizing average inventory costs subject to a fill rate constraint in a two-stage serial inventory model with a normally distributed demand. Fill rate is the fraction of demand that is satisfied immediately from on-hand inventory. We first find the lower bounds of base-stock levels in each node by using the exact base-stock level that satisfies a fill rate in a single node model proposed by Sobel. And then, we extensively analyze the system and show that the cost function is convex. Using such convexity and some other useful properties, we can easily find optimal base-stock levels numerically.

시뮬레이션을 통한 2단계 재고시스템에서의 재고정책 비교연구 (A Simulation Study for the Inventory Policy in the 2 Echelon System)

  • 정재헌
    • 산업경영시스템학회지
    • /
    • 제38권3호
    • /
    • pp.136-148
    • /
    • 2015
  • We analyzed the effect of three different types of inventory systems for saving the total cost using simulation on the system where multiple depots and many retailers disperse on the limited area. Three types of inventory systems are single echelon system with inventory exchange and two-echelon system and the variant two-echelon system. Variant two echelon system is the two-echelon system where the inventory transshipmentsare allowed on every two stage inventory echelons. Inventories kept on every retailer are commonly used for all retailers when certain retailer has stock-out. And when all retailers are stock-out, inventories kept on every depot are commonly used for the retailers whose assigned depots are stock-out. These all three systems are simulated with the constraint of service level on wide range of parameter settings. Simulation results show that cost saving effect appear clear for single echelon system and two-echelon system when shortage cost portion and transportation cost portion becomes large respectively irrespective of depot number. Variant two echelon system seems to be superior to two other systems when transportationcost portion becomes very small. But this superiority is not proved in terms of statistics. So we may conclude that the variant two echelon system may be useless with the higher administrative efforts due to frequent inventory exchange. Also we note that the traditional two echelon system becomes inferior to two other systems in terms of statistics when service level becomes high or when demand variance becomes very large. And inventory integration effect that cost becomes saved when depot number decrease, diminishes when transportation cost or stock-out cost increases irrespective of inventory systems.

Batch Scheduling Problem with Multiple Due-dates Constraints

  • Mohri, Shintaro;Masuda, Teruo;Ishii, Hiroaki
    • Industrial Engineering and Management Systems
    • /
    • 제10권1호
    • /
    • pp.1-6
    • /
    • 2011
  • This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.