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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
