Sara Carson

TL;DR: The results show that for small and medium size problems whether or not a computationally more demanding algorithm is employed to solve the level 1 or level 2 problem does not have any bearing on the makespan, but the situation changes dramatically when large size problems are attempted, as a single-setup algorithm which combines the use of single- and multiple-pass heuristic for the level 2 and level 1 problems outperforms another single- setup algorithm with the order of use reversed at all levels of flexibility.