[JBoss JIRA] Created: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
5:33 a.m.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public (Everyone can see)
Components: drools-docs-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Mark Proctor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gass-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:37 a.m.
New subject: [JBoss JIRA] Updated: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Michał Warecki updated JBRULES-2900:
------------------------------------
Component/s: drools-planner
(was: drools-docs-planner)
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Mark Proctor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gass-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:59 a.m.
New subject: [JBoss JIRA] Updated: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Michał Warecki updated JBRULES-2900:
------------------------------------
Priority: Minor (was: Major)
Description:
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
was:
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gass-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Mark Proctor
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
7:43 a.m.
New subject: [JBoss JIRA] Assigned: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet reassigned JBRULES-2900:
-----------------------------------------
Assignee: Geoffrey De Smet (was: Mark Proctor)
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
7:45 a.m.
New subject: [JBoss JIRA] Commented: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet commented on JBRULES-2900:
-------------------------------------------
Hi Michal,
Are you sure this applies to drools-planner?
If it's specifically aimed at the score rule calculation done by the RETE rule engine,
the component should be drools-expert.
If it's about how the drools-planner moves/steps should be optimized, then
drools-planner is the correct component.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
4:50 a.m.
New subject: [JBoss JIRA] Commented: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Michał Warecki commented on JBRULES-2900:
-----------------------------------------
Yes, it is about drools-planner steps optimization.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:13 a.m.
New subject: [JBoss JIRA] Commented: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet commented on JBRULES-2900:
-------------------------------------------
This should be an interesting experiment.
Personally I have my doubts:
Both the Jacoby or Gauss-Seidel method are based on writing the constraints as
mathematical equitations.
In Drools Planner, constraints are written as the far more flexible rule engine rules
(DRL),
which supports Object Oriented Programming, re-use of java code (for example
HolidayHelper.isHoliday(date, country)), complex patterns (correlation, logical
insertions, ...), custom accumulate functions, ...
However, I doubt this allows for Jacoby/Gauss-Seidel.
Furthermore, in my experience with the planning competitions, I haven't seen exact
methods such as simplex, the Hungarian method, Jacoy, Gauss-Seidel been able to scale to
the size of data and constraints in the real world.
That being said, I can be proven wrong.
Pull requests (patches) are very welcome on the source code:
https://github.com/droolsjbpm/drools-planner
If implemented, it should be interesting to compare results on the already implement
examples, such as TTP and examination.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:15 a.m.
New subject: [JBoss JIRA] Issue Comment Edited: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet edited comment on JBRULES-2900 at 3/14/11 6:15 AM:
--------------------------------------------------------------------
This should be an interesting experiment.
Personally I have my doubts:
Both the Jacoby or Gauss-Seidel method are based on writing the constraints as
mathematical equitations.
In Drools Planner, constraints are written as the far more flexible rule engine rules
(DRL),
which supports Object Oriented Programming, re-use of java code (for example
HolidayHelper.isHoliday(date, country)), complex patterns (correlation, logical
insertions, ...), custom accumulate functions, ...
However, I doubt this allows for Jacoby/Gauss-Seidel.
Furthermore, in my experience with the planning competitions, I haven't seen exact
methods such as simplex, the Hungarian method, Jacoy, Gauss-Seidel been able to scale to
the size of data and constraints in the real world.
That being said, don't hesitate to prove me wrong.
Pull requests (patches) are very welcome on the source code:
https://github.com/droolsjbpm/drools-planner
If implemented, it should be interesting to compare results on the already implement
examples, such as TTP and examination.
was (Author: ge0ffrey):
This should be an interesting experiment.
Personally I have my doubts:
Both the Jacoby or Gauss-Seidel method are based on writing the constraints as
mathematical equitations.
In Drools Planner, constraints are written as the far more flexible rule engine rules
(DRL),
which supports Object Oriented Programming, re-use of java code (for example
HolidayHelper.isHoliday(date, country)), complex patterns (correlation, logical
insertions, ...), custom accumulate functions, ...
However, I doubt this allows for Jacoby/Gauss-Seidel.
Furthermore, in my experience with the planning competitions, I haven't seen exact
methods such as simplex, the Hungarian method, Jacoy, Gauss-Seidel been able to scale to
the size of data and constraints in the real world.
That being said, I can be proven wrong.
Pull requests (patches) are very welcome on the source code:
https://github.com/droolsjbpm/drools-planner
If implemented, it should be interesting to compare results on the already implement
examples, such as TTP and examination.
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: FUTURE
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:17 a.m.
New subject: [JBoss JIRA] Updated: (JBRULES-2900) Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel iterations)
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet updated JBRULES-2900:
--------------------------------------
Fix Version/s: Out of scope
(was: FUTURE)
Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations)
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: Out of scope
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
5:23 a.m.
New subject: [JBoss JIRA] Updated: (JBRULES-2900) Planner optimization algorithms should include Jacoby and Gauss-Seidel iterations
[
https://issues.jboss.org/browse/JBRULES-2900?page=com.atlassian.jira.plug...
]
Geoffrey De Smet updated JBRULES-2900:
--------------------------------------
Summary: Planner optimization algorithms should include Jacoby and Gauss-Seidel
iterations (was: Consider concurrency tasks optimization (both Jacoby and Gauss-Seidel
iterations))
Note: concurrency task optimization (machine queue planning) is a good use case to
implement with vanilla Drools Planner with Tabu search/Simulate annealing.
Machine queue planning suffers from additional constraints which are hard to implement as
mathematical equations, such as:
- machine X can not handle type Y jobs
- prefer newer machine A over older machine B for type C jobs to lower the risk of the
quality being insufficient, unless machine A is full
- heavier products should be scheduled to machines closer to the exit
Planner optimization algorithms should include Jacoby and
Gauss-Seidel iterations
---------------------------------------------------------------------------------
Key: JBRULES-2900
URL: https://issues.jboss.org/browse/JBRULES-2900
Project: Drools
Issue Type: Feature Request
Security Level: Public(Everyone can see)
Components: drools-planner
Affects Versions: FUTURE
Reporter: Michał Warecki
Assignee: Geoffrey De Smet
Priority: Minor
Fix For: Out of scope
Will be great to support concurrency tasks optimization.
In example we have 3 tasks A, B, C and objective function 2A^2 + A*B + B^2 + AC. With
Gauss-Saidel iteration (where task B in time+2 depends on A in time+1 and C in time+2
depends on A in time+1) we can execute tasks A,B,C in order: A and BC cocurrently, so in 2
iterations. Without optimization tasks will be executed in 3 iterations (A , B, C).
We should support Jocoby iteration as well where tasks B and C does not depend on A in
previous iteration.
This can be done with Gradient Method.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
4862
days inactive
4889
days old
9 comments
2 participants
participants (2)
-
Geoffrey De Smet (JIRA) -
Michał Warecki (JIRA)