A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule.
Olivier BeaumontJulien LangouWilly QuachAlena ShilovaPublished in: Euro-Par (2020)
Keyphrases
- lower bound
- scheduling problem
- np hard
- upper bound
- branch and bound algorithm
- open shop
- single machine scheduling problem
- branch and bound
- flowshop
- optimal solution
- lower and upper bounds
- strongly np hard
- low rank
- release dates
- worst case
- job shop
- matrix factorization
- objective function
- singular value decomposition
- lower bounding
- processing times
- kernel matrix
- approximation algorithms
- pairwise
- gram matrix
- kronecker product
- minimizing makespan
- deteriorating jobs
- precedence constraints
- linear programming relaxation
- integer programming
- online learning
- single machine
- non rigid structure from motion
- factorization method
- feature space
- tensor factorization
- lagrangian relaxation
- linear programming