Matrix Chain Scheduling Problem (Matrix Chain Multiplication)
The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system.
Subproblem: Approximate MCSP
$P$: number of processors
$n$: number of matrices
Table of Algorithms