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 | Gomes, Helton Cristiano | - |
Autor(es): dc.creator | Neves, Francisco de Assis das | - |
Autor(es): dc.creator | Souza, Marcone Jamilson Freitas | - |
Data de aceite: dc.date.accessioned | 2019-11-06T13:32:04Z | - |
Data de disponibilização: dc.date.available | 2019-11-06T13:32:04Z | - |
Data de envio: dc.date.issued | 2015-01-26 | - |
Data de envio: dc.date.issued | 2015-01-26 | - |
Data de envio: dc.date.issued | 2014 | - |
Fonte completa do material: dc.identifier | http://www.repositorio.ufop.br/handle/123456789/4386 | - |
Fonte: dc.identifier.uri | http://educapes.capes.gov.br/handle/capes/557438 | - |
Descrição: dc.description | This study addresses the resource-constrained project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the activities. To solve the problem, five multi-objective metaheuristic algorithms are analyzed, based on Multi-objective GRASP (MOG), Multi-objective Variable Neighborhood Search (MOVNS) and Pare to Iterated Local Search (PILS) methods. The proposed algorithms use strategies based on the concept of Pare to Dominance to search for solutions and determine the set of non-dominated solutions. The solutions obtained by the algorithms, from asset of instances adapted from the literature, are compared using four multi-objective performance measures: distance metrics, hyper volume indicator, epsilon metric and error ratio. The computational tests have indicated an algorithm based on MOVNS as the most efficient one, compared to the distance metrics; also, a combined feature of MOG and MOVNS appears to be superior compared to the hyper volume and epsilon metrics and one based on PILS compared to the error ratio. Statistical experiments have shown a significant difference between some proposed algorithms compared to the distance metrics, epsilon metric and error ratio. However, significant difference between the proposed algorithms with respect to hyper volume indicator was not observed. | - |
Idioma: dc.language | en | - |
Direitos: dc.rights | O Periódico Computers & Operations Research concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3553121136993. | - |
Palavras-chave: dc.subject | Project management | - |
Palavras-chave: dc.subject | Resource constrained project scheduling | - |
Palavras-chave: dc.subject | Multi objective optimization | - |
Palavras-chave: dc.subject | Metaheuristics | - |
Título: dc.title | Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations. | - |
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: