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

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Han, Z., Zhang, J., Lin, S., & Liu, C. (2020). Research on the Improved Dragonfly Algorithm-Based Flexible Flow-Shop Scheduling. In Lecture Notes in Electrical Engineering (Vol. 582, pp. 205–214). Springer. https://doi.org/10.1007/978-981-15-0474-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free