Application of plant growth simulation algorithm

DOI

10.2991/icmmct-16.2016.329How to use a DOI?

Keywords

Plant Growth Simulation Algorithm; Permutation flow shop scheduling problem; Total flow time; Heuristics

Abstract

Permutation flow shop scheduling problem with total flow time criterion has been increasingly dealt with in recent years. A number of heuristics and meta-heuristics have been developed for this problem. However, the calculation of total flow time for job permutations spends too much computational time in the algorithms. Based on Plant Growth Simulation Algorithm, we propose a novel algorithm for solving permutation flow shop scheduling problems. The computation experiments based on the well-known benchmarks are provided. 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)

TY  - CONF
AU  - Zhenen Fan
PY  - 2016/03
DA  - 2016/03
TI  - Application of plant growth simulation algorithm
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Computing Technology
PB  - Atlantis Press
SP  - 1653
EP  - 1656
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmmct-16.2016.329
DO  - 10.2991/icmmct-16.2016.329
ID  - Fan2016/03
ER  -