Proceedings of the 2015 International Symposium on Computers & Informatics

A Plant Growth Simulation Algorithm for Permutation Flow Shop Scheduling Problem

Authors
Zhenhong He, Yueguang Li
Corresponding Author
Zhenhong He
Available Online January 2015.
DOI
10.2991/isci-15.2015.193How to use a DOI?
Keywords
Plant Growth Simulation Algorithm(PGSA); Permutation flow shop scheduling problem; speed-up; heuristics
Abstract

Permutation flow shop scheduling problem is a complicated global optimum problem. A number of intelligent algorithms have been used for this problem. In this paper, a plant growth simulation algorithm was used to solve permutation flow shop scheduling problem. The algorithm was experimented and the experimental results show that the Plant Growth Simulation Algorithm (PGSA)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)

Volume Title
Proceedings of the 2015 International Symposium on Computers & Informatics
Series
Advances in Computer Science Research
Publication Date
January 2015
ISBN
978-94-62520-56-1
ISSN
2352-538X
DOI
10.2991/isci-15.2015.193How to use a DOI?
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/).

Cite this article

TY  - CONF
AU  - Zhenhong He
AU  - Yueguang Li
PY  - 2015/01
DA  - 2015/01
TI  - A Plant Growth Simulation Algorithm for Permutation Flow Shop Scheduling Problem
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 1444
EP  - 1451
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.193
DO  - 10.2991/isci-15.2015.193
ID  - He2015/01
ER  -