Flowshop scheduling problem with parallel semi-lines and final synchronization operation.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorGuimarães, Irce Fernandes Gomes-
Autor(es): dc.creatorOuazene, Yassine-
Autor(es): dc.creatorSouza, Maurício Cardoso de-
Autor(es): dc.creatorYalaoui, Farouk-
Data de aceite: dc.date.accessioned2022-02-21T19:59:17Z-
Data de disponibilização: dc.date.available2022-02-21T19:59:17Z-
Data de envio: dc.date.issued2020-09-28-
Data de envio: dc.date.issued2020-09-28-
Data de envio: dc.date.issued2019-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/12773-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/abs/pii/S0305054819300942?via%3Dihub-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.cor.2019.04.011-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/650779-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectHeuristic and metaheuristic methods-
Palavras-chave: dc.subjectGRASP algorithm-
Palavras-chave: dc.subjectSimulated annealing algorithm-
Título: dc.titleFlowshop scheduling problem with parallel semi-lines and final synchronization operation.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.