Identical machines scheduling, minimizing the makespan
-
Updated
Feb 21, 2022 - Kotlin
Identical machines scheduling, minimizing the makespan
Ocado cubing algorithms for GreatUniHack 2017.
Add a description, image, and links to the np-hard topic page so that developers can more easily learn about it.
To associate your repository with the np-hard topic, visit your repo's landing page and select "manage topics."