Job Scheduling
===
- [Survey of Job Scheduling](/1AkCzFoPRyG7fYhLd-TFiA)
Fundamental Theory
---
UNRELATED PARALLEL MACHINES TO MINIMIZE WEIGHTED COMPLETION TIME
---
UNRELATED PARALLEL MACHINES TO MINIMIZE MAKESPAN
---
- [Estimating the Makespan of the Two-Valued Restricted Assignment Problem](/Z1gFlcfOQ_mxuMjnko6PBg)
MAX-MIN FAIR ALLOCATION
---
{"metaMigratedAt":"2023-06-17T09:24:03.244Z","metaMigratedFrom":"Content","title":"Job Scheduling","breaks":true,"contributors":"[{\"id\":\"51c709fa-e939-423b-bdd7-fe5b83ee1b15\",\"add\":354,\"del\":0}]"}