1. Revisiting the NEH algorithm-the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling;Baskar;Int. J. Ind. Eng. Comput.,2016
2. Effects of dummy machines on makespan in a few classical heuristics using Taillard benchmark problems;Baskar;Int. J. Mater. Prod. Technol.,2012
3. Optimization of makespan in flow shop scheduling problems using combinational NEH family of heuristics-an analysis;Baskar;Int. J. Appl. Eng. Res.,2013
4. Analysis of job insertion technique for different initial sequences in permutation flow shop scheduling problems;Baskar;Int. J. Enter. Netw.Manag.,2015
5. Benavides, A. J. (2018). A New Tiebreaker in the NEH heuristic for the Permutation Flow Shop Scheduling Problem (No. 440). EasyChair.