Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/26187
Título: | Resource constrained project scheduling with general precedence relations optimized with SAT |
Autor(es): | Alves, Rui Miguel de Freitas Alvelos, Filipe Pereira e Sousa, Sérgio |
Palavras-chave: | Project scheduling SAT |
Data: | 2013 |
Editora: | Springer |
Revista: | Lecture Notes in Computer Science (including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Resumo(s): | This paper presents an approach, based on propositional satisfiability (SAT), for the resource constrained project scheduling problem with general precedence relations. This approach combines propositional satisfiability formulations with a bisection method, in order to achieve an optimal solution. The empirical results suggest that when the optimal schedule is significantly affected by the availability of resources, this strategy outperforms the typical integer linear programming approach. |
Tipo: | Artigo em ata de conferência |
Descrição: | Publicado em "Progress in artificial intelligence : 16th Portuguese Conference on Artificial Intelligence, EPIA 2013...", ISBN 978-3-642-40668-3 |
URI: | https://hdl.handle.net/1822/26187 |
ISBN: | 9783642406683 |
DOI: | 10.1007/978-3-642-40669-0_18 |
ISSN: | 0302-9743 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: | LES/ALG - Artigos em revistas científicas internacionais com arbitragem |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
81540199.pdf Acesso restrito! | 1,69 MB | Adobe PDF | Ver/Abrir |