(PDF) A general approximation approach for multi-machine …
polynomial unsolvability measure for the single mac hine scheduling problem. 1 | r j | L max is given. It can be possibly reduced further by finding new sub-spaces of polynomially solvable instances.