공급사슬관리에서 생산입지선정 문제와 안전재고 최적화 문제의 통합모형 개발에 관한 연구 = A Study on Developing an Integrated Model of Facility Location Problems and Safety Stock Optimization Problems in Supply Chain Management

다국어 초록 (Multilingual Abstract)

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network , where is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component, but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy. We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution . Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product.In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.

참고문헌 (Reference)

• 1 "Some Facets of the Simple Plant Location Polytope" 23 : 50-74, 1982
• 2 "Safety Stock Optimisation in Multi Stage Inventory Systems" 24 : 103-113, 1991
• 3 "Reformulation and Column Generation for Several Telecommunication Network Design Problems School of Industrial Engineering" Purdue University 1993.
• 4 "Optimizing Strategic Safety Stock Placement in Supply Chains" 2 (2): 68-83, 2000
• 5 "In-process Inventories" 6 : 863-873, 1958
• 6 "Efficient Algorithm for the Capacitated Concentrator Location Problem" 14 : 197-208, 1987
• 7 "Branch- and-price：Column Generation for Solving Huge Integer Programs" 46 : 316-329, 1998
• 8 "An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing" 113 : 544-559, 1999
• 9 "An Efficient Algorithm for an Uncapacitated Facility Location Problem on a Tree Structured Network" 18 : 97-109, 1998
• 10 "Accelerated Benders Decomposition：Algorithmic Enhancement and Model Selection Criteria" 29 : 464-484, 1981
• 11 "A Pseudopolynomial-time Algorithm for Solving a Capacitated Subtree of a Tree Problem in a Telecommunication System" 22 (22): 485-498, 1996
• 12 "A Projection Method for the Uncapacitated Facility Location Problem" 1987-,
• 13 "A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-source Constraints" 37 : 495-500, 1986
• 14 "A Lagrangian Heuristic for the Capacitated Plant Location Problem with Single Source Constraints" 66 : 305-312, 1993
• 15 "A Joint Location-inventory Modelto appear in Transportation Science" 2001.
• 16 "A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem" 15 : 212-226, 1984
• 17 "A Branch-and-Price Algorithm for the Generalized Assignment Problem" 45 : 831-841, 1997