Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem.
Federico PagnozziThomas StützlePublished in: Optim. Lett. (2017)
Keyphrases
- weighted tardiness
- permutation flowshop
- scheduling problem
- tabu search
- job shop scheduling problem
- single machine
- setup times
- parallel machines
- strongly np hard
- memetic algorithm
- sequence dependent setup times
- minimize total
- np hard
- flowshop
- precedence constraints
- feasible solution
- processing times
- search procedure
- hybrid algorithm
- genetic algorithm
- search algorithm
- search space
- upper bound
- combinatorial optimization
- single machine scheduling problem
- optimal solution
- particle swarm optimization
- linear programming
- computational complexity