Abstract
The goal of the production-planning problem is to find the optimal solution from combinations that satisfy constraints. Traditionally, production-planning problems have been treated separately, due to the problem size and complex constraints, whereas the constraints in production planning spread to the entirety of production planning. For example, when the dynamic changes as machine breakdowns and new machine addition occur, a production plan should be modified with new constraints caused by these dynamic changes. Therefore, it is required to represent a set of solution candidates that satisfy constraints in production planning. Zero-Suppressed Binary Decision Diagram (ZDD) is a directed graph representation of Boolean function and can efficiently represent a set of combinations. This paper describes the validity of application of the ZDD to production planning to represent a set of solution candidates. Experimental results applied to a sample-planning problem demonstrate that the ZDD is efficiently used for production planning and for dealing with dynamic changes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Advanced Mechanical Design, Systems, and Manufacturing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
