Three-Stage-encoding Barnacle Mating Algorithm for Dynamic Manpower Scheduling in Flow Shop

Abstract

In actual industrial manufacturing scenarios, the dynamic behavior of workers is widespread.When the production starts for a while, the worker's request for leave and back will break the original production rhythm. This paper concentrates on how to reschedule workers in the flow shop under the consideration of the workers' dynamic behavior to minimize the total time of workers adjustment and production. Inspired by the Self-encoding Barnacle Mating Optimizer (SBMO) to our problem, we design a novel solution mode, offspring generation method, and neighborhood search scheme to propose the Threestage-encoding Barnacle Mating Algorithm (TBMA). Extensive experiments are conducted to test the performance of TBMA, and the results demonstrate that TBMA has competitive performance.