Abstract
In the practical production process of a flexible manufacturing system (FMS), unexpected disturbances such as rush orders arrival and machine breakdown may inevitably render the existing schedule infeasible. This makes dynamic rescheduling necessary to respond to the disturbances and to improve the efficiency of the disturbed FMS. Compared with the static scheduling, the dynamic rescheduling relies on more effective and robust search approaches for its critical requirement of real-time optimal response. In this paper, a filtered-beam-search (FBS) -based heuristic algorithm is proposed to solve the dynamic rescheduling problem in a large and complicated job shop FMS environment with realistic disturbances. To enhance its performance, the proposed algorithm makes improvement in the local/global evaluation functions and the generation procedure of branches. With respect to a due date-based objective (weighted quadratic tardiness), computational experiments are studied to evaluate the performance of the proposed algorithm in comparison with those of other popular methods. The results show that the proposed FBS-based algorithm performs very well for dynamic rescheduling in terms of computational efficiency and solution quality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.