Metaheuristic algorithms for the hybrid flowshop scheduling problem.
Hande ÖztopMehmet Fatih TasgetirenDeniz Türsel EliiyiQuan-Ke PanPublished in: Comput. Oper. Res. (2019)
Keyphrases
- flowshop
- scheduling problem
- metaheuristic algorithms
- ant colony optimization
- minimizing makespan
- processing times
- single machine
- metaheuristic
- tabu search
- setup times
- bicriteria
- sequence dependent setup times
- minimizing total tardiness
- flowshop scheduling
- total tardiness
- total flowtime
- variable neighborhood search
- precedence constraints
- np hard
- makespan minimization
- maximum lateness
- special case
- total weighted tardiness
- parallel machines
- job shop scheduling problem
- permutation flowshop
- preventive maintenance
- hybrid method
- search algorithm
- genetic algorithm
- neural network
- simulated annealing
- strongly np hard
- upper bound
- flowshop scheduling problems