Single machine problems

If all release dates are 0 and the objective function is monotone,
then only schedules without preemption have to be considered.
If all release dates are 0 then problems with pi=1 and pi=p are equivalent.
If we have unit processing times, also no preemption is necessary, because
all release dates are assumed to be integer.