Abstract

Dynamics of assembly automation systems involve the interaction of discrete-event and continuous-variable dynamics. Hence, a hybrid model is a natural framework for scheduling tasks in assembly automation processes. This study indicates that a weighted scheduling problem can be transformed into a weighted time-optimal problem for hybrid systems. In particular, it shows that the problem can be cast as a constrained optimization problem with inequalities quantifiers. In order to obtain quantifier-free inequalities, quantifier elimination techniques are used. Based on the quantifier-free inequalities, the scheduling problem of the assembly manufacturing process can be solved using linear programming methods. Applicability and simulation results are provided to illustrate the performance of the developed algorithms.

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.