Keyphrases
- strongly np hard
- scheduling problem
- setup times
- lower bound
- np hard
- approximation algorithms
- branch and bound algorithm
- permutation flowshop
- flowshop
- objective function
- sequence dependent setup times
- lower bounding
- single machine
- precedence constraints
- identical parallel machines
- special case
- processing times
- lot sizing
- upper bound
- multi item
- lower and upper bounds
- optimal solution
- search algorithm
- computational complexity
- tabu search
- worst case