On the hardness of the classical job shop problem.

Heidemarie Bräsel Martin Harborth Thomas Tautenhahn Per Willenius

Published in: Ann. Oper. Res. (1999)

Keyphrases

computational complexity
data mining
classical methods
real time
information systems
case study
search space
evolutionary algorithm
np hard
upper bound
phase transition
np hardness