Login / Signup
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion.
Ghasem Moslehi
Danial Khorasanian
Published in:
Comput. Oper. Res. (2014)
Keyphrases
</>
search algorithm for solving
scheduling problem
flowshop
lower bound
processing times
search algorithm
single machine
np hard
hybrid learning
minimum description length
optimization criterion
optimality criterion
motion estimation
tabu search
neural network
release dates
batch processing
neighborhood information