Bat Algorithm for Flexible Flow Shop Scheduling with Variable Processing Time

Abstract

In order to solve the flexible flow shop scheduling problem with variable processing time (FFSP-VPT), it is analyzed, the paper analyzes the selection mode of processing time, jobs detection mode as well as rework mode, sets up FFSP-VPT mathematical model and puts forward a two-step encode mode for FFSP-VPT. By means of simulation experiment, the results are compared to mature genetic algorithm and differential evolution algorithm so that effectiveness of bat algorithm will be verified to solve practical production of FFSP-VPT.