On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems.
Yunpeng PanLeyuan ShiPublished in: Math. Program. (2007)
Keyphrases
- lower bound
- max min
- branch and bound algorithm
- upper bound
- single machine scheduling problem
- branch and bound
- objective function
- precedence constraints
- np hard
- min max
- lower and upper bounds
- lagrangian relaxation
- optimal solution
- worst case
- artificial neural networks
- genetic programming
- integer programming
- robust optimization