Under the auspices of the Computational Complexity Foundation (CCF)
We give improved trade-off results on approximating general minimum cost scheduling problems.
