Solving RCPSP/max by lazy clause generation
Andreas Schutt, Thibaut Feydy, Peter J Stuckey, Mark G Wallace
JOURNAL OF SCHEDULING | SPRINGER | Published : 2013
We present a generic exact method for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedence relations (Rcpsp/max) This is a very general scheduling model with applications areas such as project management and production planning Our method uses lazy clause generation, i.e.; a hybrid of finite domain and Boolean satisfiability solving, in order to apply no-good learning and conflict-driven search to the solution generation Our experiments show the benefit of lazy clause generation for finding an optimal solution and proving its optimality in comparison to other state-of-the-art exact and non-exact methods In comparison to other meth..View full abstract
We are thankful to the reviewers for their helpful comments and suggestions. NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence program.