Abstract
A variable neighborhood based memetic algorithm (VNMA) is proposed to minimize makespan for a single batch processing machine in this paper. Random instances were generated to verify the effectiveness of VNMA. Comparisons are made through using a genetic algorithm (GA) addressed in the literature as a comparator method. Computational results demonstrate that VNMA outperformed the GA with respect to solutions quality and run times.
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.
