Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/26187

TitleResource constrained project scheduling with general precedence relations optimized with SAT
Author(s)Alves, Rui Miguel de Freitas
Alvelos, Filipe Pereira e
Sousa, Sérgio
KeywordsProject scheduling
SAT
Issue date2013
PublisherSpringer
JournalLecture Notes in Computer Science (including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract(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.
TypeConference paper
DescriptionPublicado em "Progress in artificial intelligence : 16th Portuguese Conference on Artificial Intelligence, EPIA 2013...", ISBN 978-3-642-40668-3
URIhttp://hdl.handle.net/1822/26187
ISBN9783642406683
DOI10.1007/978-3-642-40669-0_18
ISSN0302-9743
Peer-Reviewedyes
AccessRestricted access (UMinho)
Appears in Collections:LES/ALG - Artigos em revistas científicas internacionais com arbitragem

Files in This Item:
File Description SizeFormat 
81540199.pdf
  Restricted access
1,69 MBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID