Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling.

Eugeniusz Nowicki Czeslaw Smutnicki

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

Keyphrases

linear programming
optimal solution
dynamic programming
np hard
linear programming relaxation
objective function
worst case analysis
worst case
theoretical analysis
average case
learning algorithm
cost function
search space
lower bound
computational complexity
branch and bound algorithm
approximation algorithms