Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/12773
Registro completo de metadados
Campo Dublin Core | Valor | Idioma |
---|---|---|
dc.contributor.author | Guimarães, Irce Fernandes Gomes | - |
dc.contributor.author | Ouazene, Yassine | - |
dc.contributor.author | Souza, Maurício Cardoso de | - |
dc.contributor.author | Yalaoui, Farouk | - |
dc.date.accessioned | 2020-09-28T20:47:28Z | - |
dc.date.available | 2020-09-28T20:47:28Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | 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. | pt_BR |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/12773 | - |
dc.description.abstract | 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. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.subject | Heuristic and metaheuristic methods | pt_BR |
dc.subject | GRASP algorithm | pt_BR |
dc.subject | Simulated annealing algorithm | pt_BR |
dc.title | Flowshop scheduling problem with parallel semi-lines and final synchronization operation. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.identifier.uri2 | https://www.sciencedirect.com/science/article/abs/pii/S0305054819300942?via%3Dihub | pt_BR |
dc.identifier.doi | https://doi.org/10.1016/j.cor.2019.04.011 | pt_BR |
Aparece nas coleções: | DEPRO - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_FlowshopSchedulingProblem.pdf Restricted Access | 2,23 MB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.