A Column Generation Algorithm for the Resource-Constrained Order Acceptance and Scheduling on Unrelated Parallel Machines

Algorithm 2 The procedure of the DE algorithm.

 Step 1: initialize a population of NP individuals

 Step 2: evaluate the fitness values of the NP individuals

 Step 3: While the preset stopping condition is not satisfied DO

 Step 3.1: Mutation—create a mutant population using a mutation operator

 Step 3.2: Crossover—recombine the parent and the mutant to generate a trial population

 Step 3.3: Selection—compare the parent and trial individuals and select the better ones for the next generation

 End

 Step 4: output the best solution