On the complexity of non-preemptive shop scheduling with two jobs
scientific article; zbMATH DE number 1837286