Abstract
Abstract In this paper, we investigate the Max-Plus-Linear (MPL) representation for the integration of scheduling and control problem. This is an attractive approach because the MPL representation can result in a convex scheduling problem. Using this representation, we have formulated the integration of scheduling and control problem considering the corresponding transitions time for each processing time. Furthermore, the MPL representation is combined with the sequential decomposition method (SDM) ( Chu and You (2012) ) in order to solve the integrated problem. The final result is a formulation that preserves the convexity of the original scheduling problem. Finally, the performance of the new formulation is tested on a simple case study and compared with the traditional method.
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.
