solvers
Instructions for upstream task assignment, bin packing and dependency scheduling. LPT and FFD are heuristics rather than general optimality guarantees; validate capacities, dependencies and algorithm assumptions. Not a bundled solver runtime.
- Version
- 1.0.0
- License
- MIT
Pinned to revision 4fac303bc3ac, so it is the text this page describes rather than whatever the author pushed since.
Files
Every link opens the file at its source, pinned to the revision this page describes.