Research on the Improved Dragonfly Algorithm-Based Flexible Flow-Shop Scheduling

Abstract

Compared with the classic flexible flow shop, limited buffer flexible flow shop may have a limited buffer production blockage, which will increase the complexity and uncertainty of the scheduling process. In order to solve the limited-buffer flexible flow-shop scheduling problem (LBFFSP), a mathematical programming model of limited buffer flexible flow shop is established and an Improved Dragonfly Algorithm (IDA) is proposed to solves this problem. Based on the standard Dragonfly Algorithm (DA), the idea of Simulated Anneal (SA) is combined to improve the ability of the algorithm to jump out local extremum and the algorithm combines the standard Dragonfly Algorithm (DA) with the Simulated Anneal (SA) idea to improve the ability to jump out local extremum and improve its persistence.