New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
scientific article; zbMATH DE number 6107342