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

> Research article (Applied Soft Computing, 2017) · cited 50× · AI/ML

**Wikidata**: [openalex:W2571728354](https://www.wikidata.org/wiki/openalex:W2571728354)  
**Source**: https://4ort.xyz/entity/memetic-algorithm-with-node-and-edge-histogram-for-no-idle-flow-shop-scheduling-problem-to-minimize-the-makespan-criteri