抄録
Dynamic changes in manufacturing sites influence whole production planning. Therefore, production planning should be treated as comprehensive. However, the production planning has been treated as separate, such as process planning, production scheduling aad so on. In this study, we use Zero-Suppressed Binary Decision Diagram (ZDD) to represent only combinations satisfying the constraints in the comprehensive solution space. By searching in the ZDD, feasible solution can be obtainedコn this paper, we describe how to solve the dynamic production planning problem using the ZDD. Experimental results demonstrate that the ZDD can create and represent only feasible combinations adapting to dynamic changes, quickly.
