Metaheuristics for Solving a Hybrid Flexible Flowshop Problem with Sequence-Dependent Setup Times.
Aymen SioudCaroline GagnéMarc GravelPublished in: ICSIBO (2014)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- makespan minimization
- tabu search
- total weighted tardiness
- single machine
- single machine scheduling problem
- combinatorial optimization
- parallel machines
- minimizing total tardiness
- total tardiness
- strongly np hard
- setup times
- maximum lateness
- special case
- release dates
- processing times
- precedence constraints
- lot sizing
- simulated annealing
- ant colony optimization
- variable neighborhood search
- metaheuristic
- job shop scheduling problem
- feasible solution
- lagrangian relaxation
- search algorithm
- particle swarm optimization
- branch and bound algorithm