Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times.
Chuanjin LeiNing ZhaoSong YeXiuli WuPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- scheduling problem
- memetic algorithm
- flowshop
- tabu search
- waiting times
- setup times
- job shop
- job shop scheduling problem
- processing times
- single machine
- combinatorial optimization
- np hard
- sequence dependent setup times
- job shop scheduling
- precedence constraints
- vehicle routing problem
- parallel machines
- test problems
- search procedure
- simulated annealing
- special case
- metaheuristic
- feasible solution
- single server
- evolutionary algorithm
- search algorithm
- genetic algorithm
- evolutionary computation
- lot sizing
- linear programming
- multi item
- multi objective
- lower bound