A VND Enhanced NSGA-III Algorithm for Solving Multi-Objective Robotic Cell Scheduling Problem

With the development of economy, robotic cell Scheduling have greatly improved the production efficiency and quality of the manufacturing industry. Compared with the traditional scheduling problem, the robotic cell scheduling problem also takes into account the transportation of material between different stations. Therefore, the problem of production scheduling becomes more and more complex. In order to accelerate the convergence and improve the search ability, this paper combined VND and NSGA-III algorithm to optimize a series of problems that need to be considered in the production process, makespan, total earliness and total tardiness. Thus, the working state and operation sequence of the robot can be determined, and the production efficiency can be improved. According to the experimental result, the VND based NSGA-III algorithm has performed better than the traditional NSGA-III in considered problem.