Sciweavers

7 search results - page 1 / 2
» The Lazy Bureaucrat Scheduling Problem
Sort
View
WADS
1999
Springer
85views Algorithms» more  WADS 1999»
13 years 9 months ago
The Lazy Bureaucrat Scheduling Problem
Esther M. Arkin, Michael A. Bender, Joseph S. B. M...
CATS
2008
13 years 6 months ago
Modelling for Lazy Clause Generation
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
Olga Ohrimenko, Peter J. Stuckey
CP
2007
Springer
13 years 11 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
CP
2009
Springer
14 years 3 days ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CPAIOR
2010
Springer
13 years 10 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...