A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
scientific article; zbMATH DE number 1260415