Solving machine loading problem of flexible manufacturing systems using a modified discrete firefly algorithm

This paper proposes a modified discrete firefly algorithm (DFA) applied to the machine loading problem of the flexible manufacturing systems (FMSs) starting from the mathematical formulation adopted by Swarnkar & Tiwari (2004). The aim of the problem is to identify the optimal jobs sequence that...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of industrial engineering computations 2017-07, Vol.8 (3), p.363-372
Main Authors:	Bottani, Eleonora, Centobelli, Piera, Cerchione, Roberto, Del Gaudio, Lucia, Murino, Teresa
Format:	Article
Language:	eng
Subjects:	Discrete Firefly Algorithm Flexible Manufacturing System Machine Allocation Problem Swarm-based Optimization
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper proposes a modified discrete firefly algorithm (DFA) applied to the machine loading problem of the flexible manufacturing systems (FMSs) starting from the mathematical formulation adopted by Swarnkar & Tiwari (2004). The aim of the problem is to identify the optimal jobs sequence that simultaneously maximizes the throughput and minimizes the system unbalance according to given technological constraints (e.g. available tool slots and machining time). The results of the algorithm proposed have been compared with the existing and most recent swarm-based approaches available in the open literature using as benchmark the set of ten problems proposed by Mukhopadhyay et al. (1992). The algorithm shows results that are comparable and sometimes even better than most of the other approaches considering both the quality of the results provided and the computational times obtained.
ISSN:	1923-2926 1923-2934