Guys,
Splitting the problem into smaller ones and retracting facts totally solved
the memory problem and also speed up the process.
I would like to thank you for your responsiveness and expertise.
I am truly amazed by the activity of this community, and Drools is an
awesome piece of software !
T
Hmm, sure it makes sense. The operations and resources are independent. I
think I can safely split the problem into smaller ones. I will try this
approach.
Thanks for the tip
Le 20 mars 2014 20:51, "Wolfgang Laun" a écrit :
> I may fail to understand the fundamentals of this problem, but it seem
On 20 Mar 2014, at 19:34, Raphael Jolivet wrote:
> Thanks for you quick answer.
>
> Not yet,
>
> For that I will need to switch to fact insertion instead of Java Set.
> Do you think to will make a difference in the way the RETE Tree will be built
> ?
No it’s just a “set” pre filter for insert
I may fail to understand the fundamentals of this problem, but it seems
to me that it doesn't have the dynamic requirements that would
warrant a full "blow up" of all Resources and Operations at the same time.
We have the 300 rules, and I'm assuming that the pattern is the one
shown in OP's mail:
Thanks for you quick answer.
Not yet,
For that I will need to switch to fact insertion instead of Java Set.
Do you think to will make a difference in the way the RETE Tree will be
built ?
2014-03-20 20:27 GMT+01:00 Mark Proctor :
> Did you try using the engine in equality mode? It will only
Did you try using the engine in equality mode? It will only ever allow one
“equal” object to be inserted, others are just ignored.
Mark
On 20 Mar 2014, at 18:54, Raphael wrote:
> Hi,
>
> In our project, we use Drools to compute forbidden allocations as input for
> an allocation problem (for w
