• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.742-749
• /
• 2002

This paper deals with a continuous-review two-echelon inventory model with one-for-one replenishment and Poisson demand where transshipments among retailers are allowed. Two classes of inventory systems are considered by the number of distribution centers(DCs) which provide each retailor with inventory items. 1:N class inventory system and M:N class inventory system respectively. Two-phase model is constructed to find out the optimal inventory positions which minimize supply chain costs. Approximations for customer service levels of the system are evaluated in the first phase, and the optimal inventory positions are found subject to the constraints for service level in the second phase. Simulation tests are performed to assure the effectiveness of the proposed model. The effect of transshipment is evaluated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.362-372
• /
• 2008

Manufacturers, or vendors, and their customers continue to adopt vendor-managed inventory(VMI) program to improve supply chain performance through collaboration achieved by consolidating replenishment responsibility upstream with vendors. In this paper, we construct a mixed integer linear programming model and propose a genetic algorithm for the integrated inventory and routing problems with lost sales maximizing the total profit in the VMI supply chains which comprise of a single manufacturer and multi-retailer. The proposed GA is compared with the mathematical model on the various sized test problems with respect to the solution quality and computation time. As a result, the GA demonstrates the capability of reaching solutions that are very close to those obtained by the mathematical model for small problems and stay within 3.2% from those obtained by the mathematical model for larger problems, with a much shorter computation time. Finally, we investigate the effects of the cost and operation variables on the total profit of the problem as well as the GA performance through the sensitivity analyses.