Abstract
In this paper the decomposition of the integrated cyclic scheduling and dynamic optimization problem is analyzed using community detection. Different production systems are examined and based on the results of the community detection and the centrality of the constraint unipartite graph, a two level hierarchical structure is identified, with the scheduling problem in the first level and the dynamic optimization subproblems in the second level. The variables that link the two levels are continuous and obtained from the results of the community detection. Finally, Generalized Benders Decomposition is applied on the decomposed optimization problem obtained from the community detection and a solution is obtained faster than solving the problem monolithically.
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 callDisclaimer: 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.
