A computational study of the permutation flow shop problem based on a tight lower bound.
Talel LadhariMohamed HaouariPublished in: Comput. Oper. Res. (2005)
Keyphrases
- lower bound
- upper bound
- worst case
- data sets
- branch and bound algorithm
- branch and bound
- np hard
- empirical studies
- provide an upper bound
- complexity analysis
- lower and upper bounds
- sample complexity
- column generation
- simulation study
- statistical analysis
- special case
- search space
- optimal solution
- information retrieval
- databases