has been cited by the following article(s):
|
[1]
|
Deterministic constructive vN-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
Computers & Operations Research,
2024
DOI:10.1016/j.cor.2023.106473
|
|
|
|
|
[2]
|
A parallel graph edit distance algorithm
Expert Systems with Applications,
2018
DOI:10.1016/j.eswa.2017.10.043
|
|
|
|
|
[3]
|
Evaluation of Hierarchical Pincers Attack Search on Distributed Memory Systems
2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW),
2018
DOI:10.1109/CANDARW.2018.00066
|
|
|
|
|
[4]
|
Scalable Distributed Branch and Bound for the Permutation Flow Shop Problem
2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing,
2013
DOI:10.1109/3PGCIC.2013.86
|
|
|
|