Revision history of "New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan" (Q1761791)
From MaRDI portal
Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.