Sparrow Search Algorithm for Solving Flexible Jobshop Scheduling Problem

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

Abstract

With the global development of the third industrial revolution, intelligent manufacturing has received attention from many countries and regions since it was first proposed. In the next ten years, intelligent manufacturing has become an important factor in determining international status, and it is imminent for traditional manufacturing to switch to intelligent manufacturing. Flexible job-shop scheduling is a key research problem in the field of intelligent manufacturing. In this paper, we uses a novel swarm intelligence optimization algorithm-Sparrow Search Algorithm to solve the problem of the longest processing time of workshop scheduling. The experimental results show that compared with other advanced meta-heuristic algorithms, the Sparrow Search Algorithm (SSA) can not only achieve ideal optimization accuracy in the test function, but also can achieve acceleration effects and solving capabilities that other algorithms do not have in actual shop scheduling problems.

Cite

CITATION STYLE

APA

Wu, M., Yang, D., Yang, Z., & Guo, Y. (2021). Sparrow Search Algorithm for Solving Flexible Jobshop Scheduling Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12689 LNCS, pp. 140–154). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-78743-1_13

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