Modified Firefly Algorithm using Smallest Position Value for Job-Shop Schedulling Problems

Muhaza Liebenlito, Nur Inayah, Aisyah Nur Rahmah, Ario Widiatmoko

2018

Abstract

In this paper, we will modify the firefly algorithm to find the minimum makespan of job-shop scheduling problem. Firefly algorithm generally is used to solve continuous optimization problem which is have to modify by adding smallest position value to fit the discrete optimization problems, named Modified Firefly Algorithm–Smallest Position Value (MFASPV). The result from MFASPV is compared with Bi-directional algorithm, Tabu Search, and Discrete Firefly Algorithm. The MFASPV obtain minimum makespan as good as Tabu Search and outperform the Discrete Firefly Algorithm and Bi-directional Algorithm.

Paper Citation

in Harvard Style

Liebenlito M., Inayah N., Rahmah A. and Widiatmoko A. (2018). Modified Firefly Algorithm using Smallest Position Value for Job-Shop Schedulling Problems.In Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs, ISBN 978-989-758-407-7, pages 23-27. DOI: 10.5220/0008516600230027

in Bibtex Style

@conference{icmis18,
author={Muhaza Liebenlito and Nur Inayah and Aisyah Nur Rahmah and Ario Widiatmoko},
title={Modified Firefly Algorithm using Smallest Position Value for Job-Shop Schedulling Problems},
booktitle={Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs,},
year={2018},
pages={23-27},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008516600230027},
isbn={978-989-758-407-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs,
TI - Modified Firefly Algorithm using Smallest Position Value for Job-Shop Schedulling Problems
SN - 978-989-758-407-7
AU - Liebenlito M.
AU - Inayah N.
AU - Rahmah A.
AU - Widiatmoko A.
PY - 2018
SP - 23
EP - 27
DO - 10.5220/0008516600230027