Development of the family disaggregation algorithm for hierarchical production planning

The family disaggregation model of hierarchical production planning (HPP) is the problem of (0-1) mixed integer programming that minimizes the total sum of setup costs and inventory holding costs over the planning horizon. This problem is hard in a practical sense since optimal solution algorithms have failed to solve it within reasonable computation times. Thus an effective family disaggregation algorithm should be developed for HPP. The family disaggregation algorithm developed in this paper consists of a first stage of finding initial solutions and a second stage of improving initial solutions. Some experimental reuslts are given to verify the effectiveness of the developed disaggregation algorithm. [In Korean.]