Jansen, Klaus Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Solis-Oba, Roberto Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Jansen, K., Solis-Oba, R., & Sviridenko, M. (2000). Linear time approximation schemes for shop scheduling problems. In P. M. Pardalos (Ed.), Approximation and complexity in numerical optimization (pp. 338-346). Dordrecht, The Netherlands: Kluwer.