Scheduling on a fixed number of identical machines (\(Pm\|C_{\max}\))¶
Definition 1: Scheduling on a fixed number of identical machines
The problem \(P\,||\,C_{\max}\) in which the number \(m\) of machines is a constant, for example \(m=2\), and only the jobs \(\Jlavori\) and the processing times \(t_j \in \Z_{\ge 1}\) form the input.
What the course does on this problem¶
| Technique | Where |
|---|---|
| Definition | This page |
| Dynamic programming | Ch. 16 «Principles of dynamic programming» |
| Exercises | Exercise 16.3 |