Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation Mechanism

Algorithm 2

: The pseudo code of variable neighborhood search of dynamic self-adaptive variable work piece blocks.

Step1: Calculate the accomplishment time of the current optimal solution ().

Step2: Calculate the step.

where is the iteration, is the largest iteration, is the maximum of work piece blocks, and is the size of current work piece blocks.

Step3: Generate (random location), and delete consecutive step work pieces in from location to form a module. The deleted module is set to be , and the remaining work pieces form the sequence .

Step4:for :step

Step5:  Successively insert into corresponding location in .

Step6:  keep the result of the best location.

Step7: end.

Step8: Acquire a new solution . If , .

Step9: If , , then turn to Step 3. Or else, stop the algorithm.