New Upper Bounds for the Permutation Flowshop Scheduling Problem.
Joanna JedrzejowiczPiotr JedrzejowiczPublished in: IEA/AIE (2005)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- tight bounds
- lower and upper bounds
- branch and bound
- branch and bound algorithm
- tight upper and lower bounds
- upper bounding
- generalization error
- sample complexity
- sample size
- np hard
- vc dimension
- data mining
- concept classes
- closed form expressions
- efficiently computable
- search algorithm
- multi agent