Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times.
Quan-Ke PanLiang GaoXinyu LiKai-Zhou GaoPublished in: Appl. Math. Comput. (2017)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- parallel machines
- single machine
- makespan minimization
- maximum lateness
- single machine scheduling problem
- setup times
- total weighted tardiness
- tabu search
- minimizing total tardiness
- release dates
- total tardiness
- precedence constraints
- special case
- lot sizing
- processing times
- preventive maintenance
- np hard
- variable neighborhood search
- job shop
- dynamic programming
- branch and bound algorithm
- job shop scheduling problem
- setup cost
- combinatorial optimization
- multistage
- parallel computing
- linear program
- ant colony optimization
- metaheuristic
- strongly np hard
- particle swarm optimization
- optimization problems
- simulated annealing