Abstract
In this article, we develop a method for computing a stable supervisory control for a class of manufacturing systems (consisting of reconfigurable processors and buffers with limited capacities) with fixed supply and demand rates. It is shown that, with this method, we are able to (i) decide constructively whether a stable supervisory control exists for a given manufacturing system, and (ii) compute the stable supervisory control if it exists. Furthermore, the stable supervisory control thus obtained is complete in the sense that it contains all 'safe' sequences (of possibly concurrent buffer and processor activities) which guarantee the stability of the system. An example is presented to illustrate the proposed method. Implications and computational complexity associated with this method are discussed.
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.
