Abstract
In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.
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.
