on 01-31-2012 1:58 PM
Hi,
we generated our own brfplus agent. But how is it possible to add more than one user ID to a rule result? We want to inform a group of userIDs.
We don´t want to use MSMP Approver GroupID for the scenario, because we have to make flexible approver results regarding the request details.
Any ideas?
Thanks for your help.
Alexa
With BRF+ you would normally have a set of criteria to then generate a specific outcome (1 user ID). However, you can have multiple ways of defining the agents in the MSMP workflow directly which enables you to have multiple users assigned. This doesn't have to be an Approver Group as it can be directly mapped users or users with a specific role assigned.
If you want to use BRF+ I would carefully evaluate the selection criteria and the types of agents which you want to find so that you can map them accordingly. You might actually find that BRF+ does not represent the most pragmatic solution in this case.
Simon
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.
Hi Simon,
thanks for your response. the criterias works fine, but I have only the problem that I want to add more than one userID to the result and not only once. The group of users will not change very often, because of that we want to handel via brfplus agent rule and not via MSMP agent (direct mapped users). Regarding MSMP direct mapped users, we have to create for each agent a seperate path and a seperate initiator rule result. To handle the scenario with different agents on one stage regarding request details.
For detail:
- request include system A and company A1, then agent group A must be approve the request on one stage X
- request include system B and company B1, then agent group B must be approve the request on one stage X
How is it possible to create such a brfplus agent rule?
Are you using a decision table?
You may be able to create a separate expression within the BRF+ engine and have those multiple users assigned with the required logic to a BRF+ expression which you then reference back into the decision table result label?!
In that way, rather than have a direct input of a single user ID in the decision table, you refer to the expression.
Simon
Hi Alexa,
I'm theorising here but you should be able to have a separate decision table which actually lists the user IDs out and reports them into a new result key.
This would effectively be your CAD (in 5.3 terminology). You can then make your original decision table reference that new decision table to find the appropriate result (a list of User IDs rather than just a single entry). Alternatively, you could play with the other types of expressions (e.g. boolean formula etc) to directly work through the logic.
This could quickly end up being a complex over-engineered solution to a potentially simple problem so whilst it may be possible, I'm still not sure I'd go for it. I'd really look back at the core requirement and see whether it would be possible to manage with the direct users mapped or approvers group.
Simon
Hi Alexa, Simon,
Did you find a solution to your problem? We have a similar requirement.
- request include system A and company A1, then agent group A must be approve the request on one stage X
- request include system B and company B1, then agent group B must be approve the request on one stage X
We have been able to solve this with a BRF+ (line item) rule, but the decision table has to be maintained on a user id level, which I think suck. Is there any way to map it to a PFCG user group instead? That would be a lot easier to maintain in the future.
Best Regards,
Vit
Hi Vit,
I created a own customer BRFplus rule for my mentioned scenario and it works fine.
You must copy the line with the criterias. That means you have several lines with the same criterias only the UserID is different. All UserIDs receive the workitem and can edit the request.
Hope this works for you as well.
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.