We analyze the asymptotic worst-case performance ratio of polynomial time heuristics for the assembly line balancing problem. Assuming that P≠NP, we show that no polynomial heuristic has worst-case ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results