Login / Signup
An approximate algorithm for a high-multiplicity parallel machine scheduling problem.
Carlo Filippi
Published in:
Oper. Res. Lett. (2010)
Keyphrases
</>
dynamic programming
simulated annealing
optimal solution
computational complexity
objective function
search space
worst case
cost function
np hard
particle swarm optimization
benchmark problems
genetic algorithm
steady state