Scheduling with Rate-Modifying Activities on Parallel Machines Under Various Effects

Unlike in the preceding chapters of this part, in this chapter we turn to the models on parallel machines. The jobs of a set $$N=\left\{ 1,2,\dots ,n\right\} $$ N = 1 , 2 , ⋯ , n have to be processed on m parallel machines $$ M_{1},M_{2},\ldots ,M_{m}$$ M 1 , M 2 , … , M m , where $$m\le n$$ m ≤ n . Additionally, the decision-maker is presented with a list (RMP $$^{\left[ 1\right] }$$ 1 , RMP $$^{ \left[ 2\right] },\ldots ,$$ 2 , … , RMP $$^{\left[ K\right] }$$ K ) of $$K\ge 1$$ K ≥ 1 possible rate-modifying activities. The decision-maker may decide which of the listed RMPs to insert into a schedule, on which machine and in which order.