A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion.
Józef GrabowskiMieczyslaw WodeckiPublished in: Comput. Oper. Res. (2004)
Keyphrases
- tabu search algorithm
- tabu search
- processing times
- flowshop
- scheduling problem
- job shop scheduling problem
- solution quality
- test instances
- lower bound
- optimal solution
- metaheuristic
- neighborhood search
- single machine
- np hard
- path relinking
- branch and bound algorithm
- feature selection
- feasible solution
- search procedure
- hybrid algorithm
- vehicle routing problem
- linear programming
- initial solution