On the computational complexity of (maximum) class scheduling