Flowshop scheduling problem with parallel semi-lines and final synchronization operation.
Nenhuma Miniatura disponível
Data
2019
Autores
Guimarães, Irce Fernandes Gomes
Ouazene, Yassine
Souza, Maurício Cardoso de
Yalaoui, Farouk
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
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.
Descrição
Palavras-chave
Heuristic and metaheuristic methods, GRASP algorithm, Simulated annealing algorithm
Citação
GUIMARÃES, I. F. G. et al. Flowshop scheduling problem with parallel semi-lines and final synchronization operation. Computers and Operations Research, v. 108, p. 121-133, 2019. Disponível em: <https://www.sciencedirect.com/science/article/abs/pii/S0305054819300942>. Acesso em: 10 mar. 2020.