Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective.
Andréia F. SilvaJorge M. S. ValenteJeffrey E. SchallerPublished in: Comput. Oper. Res. (2022)
Keyphrases
- permutation flowshop
- scheduling problem
- completion times
- tabu search
- single machine
- total flowtime
- flowshop
- processing times
- np hard
- metaheuristic
- strongly np hard
- setup times
- minimizing makespan
- precedence constraints
- upper bound
- vehicle routing problem
- objective function
- parallel machines
- greedy algorithm
- genetic algorithm
- particle swarm optimization
- single machine scheduling problem
- combinatorial optimization
- sequence dependent setup times
- response time
- lower bound
- approximation algorithms
- job shop scheduling problem
- feasible solution
- release dates