Reducing the feasible solution space of resource-constrained project instances

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorVanhoucke, Mario-
Autor(es): dc.creatorCoelho, José-
Data de aceite: dc.date.accessioned2025-08-21T15:16:05Z-
Data de disponibilização: dc.date.available2025-08-21T15:16:05Z-
Data de envio: dc.date.issued2024-10-24-
Data de envio: dc.date.issued2024-10-24-
Data de envio: dc.date.issued2024-02-06-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/10400.2/16685-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/10400.2/16685-
Descrição: dc.descriptionThis paper present an instance transformation procedure to modify known instances of the resource-constrained project scheduling problem to make them easier to solve by heuristic and/or exact solution algorithms.The procedure makes use of a set of transformation rules that aim at reducing the feasible search space without excluding at least one possible optimal solution. The procedure will be applied to a set of 11,183 instances and it will be shown by a set of experiments that these transformations lead to 110 improved lower bounds,16 new and better schedules (found by three meta-heuristic procedures and a set of branch-and-bound procedures) and even 64 new optimal solutions which were never not found before.-
Descrição: dc.descriptioninfo:eu-repo/semantics/publishedVersion-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Publicador: dc.publisherElsevier-
Palavras-chave: dc.subjectResource-constrained project scheduling-
Palavras-chave: dc.subjectInstance complexity-
Palavras-chave: dc.subjectProject networks-
Palavras-chave: dc.subjectResource constraints-
Título: dc.titleReducing the feasible solution space of resource-constrained project instances-
Aparece nas coleções:Repositório Aberto - Universidade Aberta (Portugal)

Não existem arquivos associados a este item.