A Metaheuristic for No-wait Flowshops with Variable Processing Times.
Yi XuXiaoping LiChaomin ShiMingyu CuiXincheng CaoYanyan GePublished in: CSCWD (2018)
Keyphrases
- processing times
- metaheuristic
- makespan minimization
- total weighted tardiness
- tabu search
- scheduling problem
- single machine
- flowshop
- optimization problems
- simulated annealing
- ant colony optimization
- scatter search
- variable neighborhood search
- search space
- single machine scheduling problem
- combinatorial optimization problems
- combinatorial optimization
- genetic algorithm
- path relinking
- optimal solution
- particle swarm optimization
- polynomially solvable
- vehicle routing problem
- setup times
- release dates
- evolutionary algorithm
- set of benchmark instances
- benchmark instances
- harmony search
- traveling salesman problem