On some lower bounds for the permutation flowshop problem.
Sebastian Cáceres GelvezThu Huong DangAdam N. LetchfordPublished in: Comput. Oper. Res. (2023)
Keyphrases
- permutation flowshop
- lower bound
- upper bound
- strongly np hard
- total flowtime
- scheduling problem
- branch and bound algorithm
- np hard
- branch and bound
- lower and upper bounds
- worst case
- optimal solution
- objective function
- vc dimension
- greedy algorithm
- lower bounding
- approximation algorithms
- quadratic assignment problem
- single machine
- lagrangian relaxation
- setup times
- markov chain
- search space