NP-hardness of compact scheduling in simplified open and flow shops.

Krzysztof Giaro

Published in: Eur. J. Oper. Res. (2001)

Keyphrases

np hardness
np hard
scheduling problem
approximation algorithms
worst case analysis
scheduling algorithm
special case
mixed integer
lower bound
worst case
bayesian inference
linear program
graphical models
decision making
upper bound
evolutionary algorithm
bayesian networks