References of "Cherri, Luiz Henrique"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAn Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended Flexible Job Shop Scheduling Problem
Tessaro Lunardi, Willian UL; Voos, Holger UL; Cherri, Luiz Henrique

in 34th ACM/SIGAPP Symposium On Applied Computing, Limassol, Cyprus April 8-12, 2019 (2019, April 08)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 228 (33 UL)
Full Text
Peer Reviewed
See detailAn Imperialist Competitive Algorithm for a Real-World Flexible Job Shop Scheduling Problem
Tessaro Lunardi, Willian UL; Voos, Holger UL; Cherri, Luiz Henrique

in 23rd IEEE International Conference on Emerging Technologies and Factory Automation, Torino, Italy, September 4-7, 2018 (2018, September)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 188 (33 UL)
Full Text
Peer Reviewed
See detailA Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints
Tessaro Lunardi, Willian UL; Cherri, Luiz Henrique; Voos, Holger UL

in 17th International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland, June 3-7, 2018 (2018, June)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 226 (30 UL)