[en] Traditional planning and scheduling techniques still hold important roles in modern smart scheduling systems. Realistic features present in modern manufacturing systems need to be incorporated into these techniques. The real-world problem addressed here is an extension of flexible job shop scheduling problem and is issued from the modern printing and boarding industry. The precedence between operations of each job is given by an arbitrary directed acyclic graph rather than a linear order. In this paper, we extend the traditional FJSP solutions representation to address the parallel operations. We propose an imperialist competitive algorithm for the problem. Several instances are used for the experiments and the results show that, for the considered instances, the proposed algorithm is faster and found better or equal solutions compared to the state-of-the-art algorithms.
Disciplines :
Computer science
Author, co-author :
TESSARO LUNARDI, Willian ; 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
External co-authors :
yes
Language :
English
Title :
An Imperialist Competitive Algorithm for a Real-World Flexible Job Shop Scheduling Problem
Publication date :
September 2018
Event name :
23rd IEEE International Conference on Emerging Technologies and Factory Automation
Event date :
04/09/2018 to 07/09/2018
Audience :
International
Main work title :
23rd IEEE International Conference on Emerging Technologies and Factory Automation, Torino, Italy, September 4-7, 2018