Pages that link to "Item:Q1761791"
From MaRDI portal
The following pages link to New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791):
Displayed 2 items.