Multiple matching criteria for the resolution of dependencies

The execution of an operation or occurrence in the plan may be specified to depend on the completion of another operation or occurrence. The operation or occurrence that depends on another is named successor. A successor depends on a predecessor. After a dependency is defined in the database, the process by which it is resolved in the plan can be defined as finding the best match between the operations or, if this is not possible, the occurrences that they are part of. The process takes as its primary basis the input arrival times of the successor and of the predecessor: starting from the input arrival time of the successor, the dependency is resolved when a predecessor with the input arrival time that best matches the selection criteria defined in the database is found.

As described in Specifying dependency resolution criteria, there are several options for defining in the Application Description how a dependency between predecessor and successor operations is resolved. According to the type of dependency, the resolution criterion is delimited within the following date and time interval:
Closest Preceding (C)
The interval goes from infinity to the IA time of the successor.
Same scheduled date (S)
The interval starts on the same day of the IA time of the successor if the IA time is after the start of day defined in the calendar. If the IA time of the successor is earlier or equal to the start of day, then the interval starts the day before. The end is 24 hours later.
Relative interval (R)
The start and end are offsets specified in terms of hours and minutes with respect to the IA time of the successor.
absolute interval (A)
The start and end are specific time boundaries specified for up to seven days before, after, or around the IA time of the successor.

In addition, the resolution of a normal dependency may be defined mandatory at plan level where, if the predecessor is not in the plan, the plan (LTP and DP) fails directly, or at control level where, if the predecessor is missing, a mandatory pending predecessor entry is added and the occurrence remains in waiting status. The mandatory dependency resolution mechanism does not apply to conditional or cross dependencies.

Dependencies are defined in the database and resolved in the plans (long-term, current, and daily). In the long-term and daily plans, they are resolved when the batches run. In the current plan, they are resolved when occurrences are added dynamically through PIF, ETT, ISPF, or the Dynamic Workload Console. The next sections detail the mechanisms used for resolving dependencies at the different plan stages.