The counting complexity of a simple scheduling problem.

Gerardo Berbeglia

Published in: Oper. Res. Lett. (2009)

Keyphrases

scheduling problem
np hard
database
neural network
decision problems
single machine
computational complexity
computational cost
worst case
tabu search