Lower-bound estimation for multi-bitwidth scheduling.
Junjuan XuJason CongXu ChengPublished in: ISCAS (1) (2005)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- scheduling problem
- np hard
- objective function
- lower and upper bounds
- branch and bound
- lower bounding
- optimal solution
- round robin
- sufficiently accurate
- maximum likelihood estimation
- estimation error
- parameter estimation
- worst case
- estimation accuracy
- lagrangian relaxation
- estimation process
- computational complexity
- neural network
- flexible manufacturing systems
- competitive ratio
- data sets