Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming
Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming
We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. …