Abstract
Dynamic disturbances such as rush job arrivals and process delay are inevitable occurrences in production environment. Dynamic job shop scheduling problem (DJSSP) is known as NP-hard combinatorial optimization problem, this paper introduces an efficient strategy for the problem. Inspired by rolling horizon strategy, the hybrid periodic and event-driven rolling horizon strategy (HRS) is presented to trigger rescheduling in a dynamic environment with process delay and rush job arrivals. Within the framework, an improved genetic algorithm (IGA) with local search is proposed to generate the rescheduling scheme of unprocessed and new jobs. To evaluate the performance of proposed algorithm, various benchmark problems and different dynamic disturbances are considered to carry out detailed experiments. The results indicate that the proposed algorithm produces superior solutions for benchmark problems and solves the DJSSP effectively with different disturbances under dynamic manufacturing environment.
Sign-in/Register to access full text options 
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.
