Memetic algorithm with node and edge histogram for no-idle...

Applied Soft Computing 2017 / 05 Vol. 54

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

Shao, Weishi, Pi, Dechang, Shao, Zhongshi
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
54
Language:
english
Journal:
Applied Soft Computing
DOI:
10.1016/j.asoc.2017.01.017
Date:
May, 2017
File:
PDF, 1.05 MB
english, 2017
Conversion to is in progress
Conversion to is failed