Abstract
Abstract In response to an unexpected arrival of new jobs, this paper investigates the single-machine maximum lateness rescheduling problem subject to an upper limit on the total sequence disruption. Problem-specific variable neighborhood search (VNS) meta-heuristics are developed to obtain the near-optimal solution. A computational experiment is conducted to evaluate their performances. As shown by the obtained results, the VNS algorithms have quite high accuracy to the optima for instances up to 24 jobs (with the mean error percentage of less than 0.5%). Besides, it is found that the first proposed VNS alternative is more recommended.
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.
