Multitasking Scheduling Problems with Deterioration Effect

Algorithm 1

Step 1. For from to do

 Step 1.1. .

 Step 1.2. For from to do

 .

Step 2. For from to do

 Step  2.1. Compute every cost coefficient with Equations. (5) for .

 Step  2.2. Obtain the local optimal sequence and the corresponding makespan related cost by

 solving the assignment problem .

Step 3. The optimal solution is the sequence and the position of the DRMA that leads to the lowest

makespan-related cost.

Step 4. Schedule the DRMA in the position of and the jobs with multitasking as the sequence .