Showing papers by "Nikolay Tchernev published in 2016"

TL;DR: An evolution of the GRASPxELS for the Flexible Job-shop problem is proposed, resulting in aGRASP with a bi-level ELS paradigm, which allowed to find state of the art solutions for Barnes and Chambers’ instances, and sound solutions for the famous instances of Dauzere-Peres while still being competitive on all this set of instances.

TL;DR: An efficient heuristic algorithm is proposed that relies on a simulated annealing algorithm aimed at searching for a better solution during the schedule construction stage and uses some well-known dominance properties for this problem.