Sparse Monge matrices arising from scheduling problems.
Charles N. GloverMichael O. BallPublished in: Oper. Res. Lett. (2013)
Keyphrases
- scheduling problem
- sparse matrix
- coefficient matrix
- processing times
- high dimensional
- single machine
- flowshop
- job shop scheduling problem
- job shop scheduling
- tabu search
- binary matrices
- np hard
- low rank matrices
- precedence constraints
- signal recovery
- low rank approximation
- setup times
- job shop
- singular value decomposition
- theoretical guarantees
- optimal solution
- sparse data
- low rank matrix
- low rank
- sparse coding
- list scheduling
- low rank and sparse