Navegando por Autor "Yalaoui, Farouk"

Filtrar resultados informando as primeiras letras
Agora exibindo 1 - 2 de 2
  • Nenhuma Miniatura Disponível
    Item
    Flowshop scheduling problem with parallel semi-lines and final synchronization operation.
    (2019) Guimarães, Irce Fernandes Gomes; Ouazene, Yassine; Souza, Maurício Cardoso de; Yalaoui, Farouk
    This paper deals with a particular variant of the flowshop scheduling problem motivated by a real case configuration issued from an electro-electronic material industry. The shop floor environment is composed of two parallel semi-lines and a final synchronization operation. The jobs must follow the same technological order through the machines on each parallel semi-line. However, the operations on each semi-line are independent. The final synchronization operation, operated by a dedicated machine, can only start when the job is finished on both semi-lines. The objective is to determine a schedule that minimizes the makespan for a given set of jobs. Since this problem class is NP-hard in the strong sense, constructive heuristic procedures and metaheuristics methods are introduced to achieve optimal or near-optimal solutions. The performances of the proposed GRASP and the Simulated Annealing algorithms are evaluated and compared with the adaptation of two well-known heuristics. Computational experiments show that the proposed metaheuristics provide very good results in low computational times.
  • Nenhuma Miniatura Disponível
    Item
    Semi-parallel flow shop with a final synchronization operation scheduling problem.
    (2016) Guimarães, Irce Fernandes Gomes; Ouazene, Yassine; Souza, Maurício Cardoso de; Yalaoui, Farouk
    This article discusses a variant of flow shop scheduling problem based on a real case issued from an electro-electronic material industry. The environment under study consists of an assembly line formed by two semi-lines and a final synchronization operation. Semi-lines have parallel operations and provide semi-products for the synchronization operation which completes the manufacturing activity by the assembly of semi-products. The aim of this study is to achieve the schedule of jobs in order to minimize the makespan. This article presents the achieved results by a mixed integer linear programming model, variants of the NEH heuristic and an adaptation of Johnson’s algorithm dedicated to the proposed special case. The proposed methods are tested among different instances inspired from Taillard (1993)’s benchmark. Based on the obtained results, we discuss the performance of the different methods.