A GISMOO Algorithm for a Multi-Objective Permutation Flowshop with Sequence-Dependent Setup Times.
Aymen SioudCaroline GagnéJulien DortPublished in: IJCCI (ECTA) (2015)
Keyphrases
- multi objective
- optimization algorithm
- search space
- scheduling problem
- computational complexity
- objective function
- worst case
- upper bound
- strongly np hard
- sequence dependent setup times
- single machine scheduling problem
- single machine
- combinatorial optimization
- simulated annealing
- dynamic programming
- np hard
- optimal solution