Abstract
We describe a new implementation of the Kimemia-Gershwin hierarchical policy for the real-time scheduling of flexible manufacturing systems. Major improvements result at all three levels of the policy. The algorithm simplification, resulting in substantial reductions of off-line and on-line computation time, is reported, as is the improvement in performance through the elimination of chattering. Simulation results based on a detailed model of a printed circuit card assembly facility are summarized.
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.
