Abstract: The NEH heuristic is commonly regarded as the best constructive heuristic for solving the permutation flow-shop scheduling problem (PFSP) with the makespan criterion. Since its appearance in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback