Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion

Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion

Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 54, May 2017, Pages 164-182

Weishi Shao, Dechang Pi, Zhongshi Shao,