A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines.

Jianming Dong Jueliang Hu Guohui Lin

Published in: Optim. Lett. (2016)

Keyphrases

worst case
computational complexity
particle swarm optimization
flowshop scheduling
neural network
cost function
np hard
dynamic programming
simulated annealing
optimal solution
search algorithm
upper bound
search procedure