An improved shuffled frog leaping algorithm and its application in permutation flow shop scheduling problem in machine fault conditions

DOI

10.2991/isci-15.2015.130How to use a DOI?

Keywords

Shuffled frog leaping algorithm; permutation flow shop scheduling problem; mutation operator; Machine Breakdown

Abstract

In order to enhance the performance of shuffled frog leaping algorithm in solving optimization problem, this paper added the mutation operator to original shuffled frog leaping algorithm, an improved shuffled frog-leaping algorithm of solving permutation flow shop scheduling problem was proposed. Simulation results show that the improved algorithm has better feasibility and validity for solving permutation flow shop scheduling problem.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yueguang Li
PY  - 2015/01
DA  - 2015/01
TI  - An improved shuffled frog leaping algorithm and its application in permutation flow shop scheduling problem in machine fault conditions
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 983
EP  - 990
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.130
DO  - 10.2991/isci-15.2015.130
ID  - Li2015/01
ER  -