Application of firefly algorithm for job shop scheduling

DOI

10.2991/icmmct-16.2016.330How to use a DOI?

Keywords

Firefly Algorithm; Job Shop Scheduling Problem; job splitting; Intelligent optimization algorithms

Abstract

An improved firefly algorithm is proposed for solving the job shop scheduling problem．Starting with the characteristic of job shop scheduling problem, combining disjunctive graph according to the sequence of scheduling, analyzing Scheduling options that decided by exchangeable set and alternative set, and then we can determine the optimal scheduling. Simulation results based on well-known benchmarks and comparisons with standard genetic algorithm demonstrate the effectiveness of the proposed bionic algorithm.

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  - Guiying Mai
PY  - 2016/03
DA  - 2016/03
TI  - Application of firefly algorithm for job shop scheduling
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Computing Technology
PB  - Atlantis Press
SP  - 1657
EP  - 1661
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmmct-16.2016.330
DO  - 10.2991/icmmct-16.2016.330
ID  - Mai2016/03
ER  -