Multiobjective Differential Evolution Algorithm for Solving Robotic Cell Scheduling Problem With Batch-Processing Machines

Abstract

Robotic cell scheduling problem with batch-processing machines (RCSP-BMs) needs to determine the processing sequence and the transferring sequence simultaneously. The buffer size before and after the batch-processing machines has a big influence on the scheduling solution. A big amount of energy is always consumed by batch-processing machines. Hybrid flow shop scheduling has been proven NP-hard, and the features of the batch-processing machines in a flow shop make the hybrid flow shop scheduling more difficult. This study proposes a multiobjective differential evolution (DE) algorithm to address these issues. First, a mathematical optimization model is formulated for the RCSP-BMs to minimize makespan and energy consumption of the batch-processing machines. Second, the multiobjective DE algorithm (MODE) is developed. A green scheduling algorithm is designed to decode the individuals to balance the makespan and energy consumption. A local search method is also presented to help the searching escape from the local optimum. Finally, experiments are carried out, and the results show that the MODE can solve the robotic cell scheduling problem with batch-processing machines effectively and efficiently. Note to Practitioners-This study focuses on the robotic cell scheduling problem with batch-processing machines (RCSP-BMs) and discusses the influence of the buffer sizes and different batching methods on scheduling. In this study, we propose a green scheduling algorithm and a multiobjective differential evolution algorithm to optimize the makespan and the energy consumption of the batch-processing machines simultaneously. In future research, we will address more complicated situations, such as many-objective optimization and many-robot scheduling.