A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling.
Willy QuachJulien LangouPublished in: CoRR (2015)
Keyphrases
- lower bound
- scheduling problem
- unrelated parallel machines
- release dates
- upper bound
- parallel machines
- batch processing
- round robin
- np hard
- single machine
- scheduling algorithm
- flexible manufacturing systems
- precedence constraints
- deteriorating jobs
- scheduling jobs
- job shop
- processing times
- worst case
- optimal solution
- setup times
- production scheduling
- flowshop
- resource allocation
- maximum lateness
- objective function