Login / Signup
A study of flexible flow shop scheduling problem with variable processing times based on improved bat algorithm.
Jianyong Bian
Liying Yang
Published in:
Int. J. Simul. Process. Model. (2020)
Keyphrases
</>
processing times
dynamic programming
worst case performance ratio
computational complexity
cost function
learning algorithm
objective function
np hard
simulated annealing
bin packing
benchmark problems
single machine scheduling problem
error bounds
convergence rate
single machine
search procedure