Reference : An Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
An Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended Flexible Job Shop Scheduling Problem
Tessaro Lunardi, Willian mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Voos, Holger [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Engineering Research Unit >]
Cherri, Luiz Henrique []
34th ACM/SIGAPP Symposium On Applied Computing, Limassol, Cyprus April 8-12, 2019
34th ACM/SIGAPP Symposium On Applied Computing
08-04-2019 to 12-04-2019
[en] flexible job shop scheduling ; imperialist competitive algorithm ; tabu search ; parallel operations
[en] An extended version of the flexible job shop problem is tackled in this work. The investigated extension of the classical flexible job shop problem allows the precedences between the operations to be given by an arbitrary directed acyclic graph instead of a linear order. The problem consists of designating the operations to the machines and sequencing them in compliance with the supplied precedences. The goal in the present work is the minimization of the makespan. In order to produce reasonable outcomes in acceptable time, a hybrid imperialist competitive algorithm and tabu search is proposed to solve the problem. Numerical experiments assess the efficiency of the proposed method and compare it with well-known scheduling algorithms.

File(s) associated to this reference

Fulltext file(s):

Open access
2019_SAC_PRE_PRINT.pdfAuthor preprint862.66 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.