Identical Parallel Machine (Scheduling)

Definition

Identical Parallel Machine (Scheduling)

A machine $m$ is called if the processing times of all jobs $j$ do not change when switching to another machine $m^{\prime }\ne m$, i.e.,

$$\forall m:\forall j:\left(p_{mj}=p_{m^{\prime }j}⟹m=m^{\prime }\right)$$