Reference : A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Proble...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/35470
A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints
English
Tessaro Lunardi, Willian mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Cherri, Luiz Henrique []
Voos, Holger [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Engineering Research Unit >]
Jun-2018
17th International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland, June 3-7, 2018
Yes
No
International
17th International Conference on Artificial Intelligence and Soft Computing (ICAISC 2018)
03/06/2018 to 07/06/2018
[en] Firefly algorithm ; Flexible job-shop scheduling ; Metaheuristics ; Mixed integer linear programming ; availability constraints
[en] Manufacturing scheduling strategies have historically ignored the availability of the machines. The more realistic the schedule, more accurate the calculations and predictions. Availability of machines will play a crucial role in the Industry 4.0 smart factories. In this paper, a mixed integer linear programming model (MILP) and a discrete firefly algorithm (DFA) are proposed for an extended multi-objective FJSP with availability constraints (FJSP-FCR). Several standard instances of FJSP have been used to evaluate the performance of the model and the algorithm. New FJSP-FCR instances are provided. Comparisons among the proposed methods and other state-of-the-art reported algorithms are also presented. Alongside the proposed MILP model, a Genetic Algorithm is implemented for the experiments with the DFA. Extensive investigations are conducted to test the performance of the proposed model and the DFA. The comparisons between DFA and other recently published algorithms shows that it is a feasible approach for the stated problem.
http://hdl.handle.net/10993/35470

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
2018_ICAISC.pdfPublisher postprint318.45 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.