author Dosung Go 
2nd author Youngcheol Yang
Yangja Jang 
info IE Interfaces, Vol. 13, No. 3, pp.378-387, 2000 
year 2000 
c DJ 
저널/학회 IE Interfaces 
group  
keyword  
abstract As the globalization of manufacturing companies continues, the scope of dependence between these companies and distributors, and other suppliers are growing very rapidly since no one company manufactures or distributes the whole product by themselves. And, the need to increase the efficiency of the whole supply chain is increasing. This paper deals with a multi-plant lot-sizing problem(MPLSP) which happens in a decentralized manufacturing system of a supply chain. In this study, we assume that the whole supply chain is driven by a single source of independent demand and many levels of dependent demands among manufacturing systems in the supply chain. We consider setup cost, transportation cost and time, and inventory holding cost as a decision factor in the MPLSP. The MPLSP is decomposed into two sub-problems: a planning problem of the whole supply chain and a lot-sizing problem of each manufacturing system. The supply chain planning problem becomes a pure linear programming problem and a Generalized Goal Decomposition method is used to solve the problem. Its result is used as a goal of the lot-sizing problem. The lot-sizing problem is solved using the CPLEX package, and then the coefficients of the planning problem are updated reflecting the lot-sizing solution. This procedure is repeated until termination criteria are met. The whole solution process is similar to Lagrangian relaxation method in the sense that the solutions are approaching the optimum in a recursive manner. Through experiments, the proposed closed-loop hierarchical planning and traditional hierarchical planning are compared to optimal solution, and it is shown that the proposed method is a very viable alternative for solving production planning problems of decentralized manufacturing systems and in other areas.