Atenção: Todas as denúncias são sigilosas e sua identidade será preservada.
Os campos nome e e-mail são de preenchimento opcional
Metadados | Descrição | Idioma |
---|---|---|
Autor(es): dc.creator | Guimarães, Irce Fernandes Gomes | - |
Autor(es): dc.creator | Ouazene, Yassine | - |
Autor(es): dc.creator | Souza, Maurício Cardoso de | - |
Autor(es): dc.creator | Yalaoui, Farouk | - |
Data de aceite: dc.date.accessioned | 2022-02-21T19:59:17Z | - |
Data de disponibilização: dc.date.available | 2022-02-21T19:59:17Z | - |
Data de envio: dc.date.issued | 2020-09-28 | - |
Data de envio: dc.date.issued | 2020-09-28 | - |
Data de envio: dc.date.issued | 2019 | - |
Fonte completa do material: dc.identifier | http://www.repositorio.ufop.br/handle/123456789/12773 | - |
Fonte completa do material: dc.identifier | https://www.sciencedirect.com/science/article/abs/pii/S0305054819300942?via%3Dihub | - |
Fonte completa do material: dc.identifier | https://doi.org/10.1016/j.cor.2019.04.011 | - |
Fonte: dc.identifier.uri | http://educapes.capes.gov.br/handle/capes/650779 | - |
Descrição: dc.description | 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. | - |
Formato: dc.format | application/pdf | - |
Idioma: dc.language | en | - |
Direitos: dc.rights | restrito | - |
Palavras-chave: dc.subject | Heuristic and metaheuristic methods | - |
Palavras-chave: dc.subject | GRASP algorithm | - |
Palavras-chave: dc.subject | Simulated annealing algorithm | - |
Título: dc.title | Flowshop scheduling problem with parallel semi-lines and final synchronization operation. | - |
Aparece nas coleções: | Repositório Institucional - UFOP |
O Portal eduCAPES é oferecido ao usuário, condicionado à aceitação dos termos, condições e avisos contidos aqui e sem modificações. A CAPES poderá modificar o conteúdo ou formato deste site ou acabar com a sua operação ou suas ferramentas a seu critério único e sem aviso prévio. Ao acessar este portal, você, usuário pessoa física ou jurídica, se declara compreender e aceitar as condições aqui estabelecidas, da seguinte forma: