Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering

Application of plant growth simulation algorithm for permutation flow shop scheduling problem

Authors
Baohua Yan
Corresponding Author
Baohua Yan
Available Online December 2015.
DOI
10.2991/nceece-15.2016.153How to use a DOI?
Keywords
Plant Growth Simulation Algorithm; Permutation flow shop scheduling problem; intelligent algorithms; global optimum problem
Abstract

Based on Plant Growth Simulation Algorithm, we propose a novel algorithm for solving permutation flow shop scheduling problems. Starting with the characteristic of permutation flow shop scheduling problems, combining disjunctive graph according to the sequence of scheduling, analyzing Scheduling options that decided by exchangeable set and alternative set. Simulation results that the Plant Growth Simulation Algorithm (PGSA) has better feasibility and validity for solving permutation flow shop scheduling problem.

Copyright
© 2016, 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)

Volume Title
Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
Series
Advances in Engineering Research
Publication Date
December 2015
ISBN
978-94-6252-150-6
ISSN
2352-5401
DOI
10.2991/nceece-15.2016.153How to use a DOI?
Copyright
© 2016, 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/).

Cite this article

TY  - CONF
AU  - Baohua Yan
PY  - 2015/12
DA  - 2015/12
TI  - Application of plant growth simulation algorithm for permutation flow shop scheduling problem
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 831
EP  - 835
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.153
DO  - 10.2991/nceece-15.2016.153
ID  - Yan2015/12
ER  -