Abstract

Based on the weighted placed-timed Petri Net models of flexible manufacturing system, this paper considers a scheduling problem which minimizes both productive and idle energy consumption subjected to the general production constraints. The considered problem is proven to be a non-convex mixed integer nonlinear program. A new reachability graph-based discrete dynamic programming approach is proposed for generating near energy-optimal schedules within adequate computational time. Our results on an industrial stamping system show the effectiveness of the proposed scheduling method in terms of computational time and deviation from optimality.

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 call

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.