Scheduling on unrelated parallel machines (\(R\|C_{\max}\))¶
Definition 1: Scheduling on unrelated parallel machines
In the three-field notation \(\alpha\,|\,\beta\,|\,\gamma\), the machine environment \(\alpha=R\) denotes unrelated parallel machines; \(R\,||\,C_{\max}\) assigns jobs without additional characteristics to such machines, minimizing the makespan \(C_{\max}\).
What the course does on this problem¶
| Technique | Where |
|---|---|
| Definition | Ch. 7 «Scheduling problems» |