This planning algorithm in the Community Edition respects the setup matrices, but does NOT do any effort to reduce the setup times and does NOT have all logic to handle the complexities of propagating setup changes. Your mileage will vary.
In the Enterprise Edition the more advanced solver will reduce the setup times by choosing smartly among different available alternate resources and by planning operationplans adjacent to others requiring the same setup.
A setup matrix defines the time and cost of setup conversions on a resource. Within a setup matrix rules are used to define the changeover cost and duration.
See Setup Matrices for a complete demo model using the setup matrix functionality.
To compute the time of a changeover the algorithm will evaluate all rules in sequence (in order of priority). As soon as a matching rule is found, it is applied and subsequent rules are not evaluated. If no matching rule is found, that changeover is not allowed.
Here is a example setup matrix to illustrate the matching:
Based on this matrix:
Unique name of the setup matrix.
This is the key field and a required attribute.
|rules||list of setup matrix rules||A read-only list of rules in this matrix.|
Within a setup matrix rules are used to define the changeover cost and duration.
The rules are evaluated in sequence, starting with the lowest priority number.
The priority of the rule.
This is the key field.
The previous setup.
If the field is empty the rules applies to any previous setup value.
The new setup.
If the field is empty the rules applies to any new setup value.
|duration||timeperiod||Duration of the changeover.|
|cost||double||Cost of the changeover.|