Login / Signup
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times.
Jinliang Cheng
George Steiner
Paul Stephenson
Published in:
Eur. J. Oper. Res. (2001)
Keyphrases
</>
computational complexity
objective function
cost function
np hard
upper bound
learning effect
genetic algorithm
optimal solution
learning environment
dynamic programming
worst case
simulated annealing
ant colony optimization
computational efficiency
hybrid algorithm