Pages that link to "Item:Q583101"
From MaRDI portal
The following pages link to The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101):
Displayed 1 item.
The following pages link to The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101):
Displayed 1 item.