Pages that link to "Item:Q1941204"
From MaRDI portal
The following pages link to A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204):
Displaying 2 items.
The following pages link to A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204):
Displaying 2 items.