Additional Windchill Capabilities > Manufacturing Process Management > Customizing the Process Plan Explorer > Customizing Work Instructions > Info*Engine Tasks Used in Work Instructions
  
Info*Engine Tasks Used in Work Instructions
The following table lists and describes the Info*Engine tasks used to gather the data used in work instructions.
Info*Engine Task
Description
describeAttributes.xml
Each webject in this task creates a group where the values of the attributes are localized. These localized values are then displayed in the work instructions report.
getOperationData.xml
The webjects in this task query an operation for the data that is displayed in the work instructions report. The following data sets are collected; work center, process, parts, manufacturing capabilities, resources, and documents. Each set of data is stored in an Info*Engine group.
getOperationsAndStProceduresUnderAnOperation.xml
The webjects in this task create a group containing all the first depth sub-operations and standard procedures found under a particular operation.
getProcessPlanAndAssemblyInformation.xml
The webjects in this task create a group containing information on the assembly associated to the process plan.
getSequencesAndStProceduresUnderAProcessPlan.xml
The webjects in this task create a group containing all the first depth sequences and standard procedures found under a process plan.
sortingOperations.xml
The webjects in this task create a group containing the sub-operations and standard procedures found under a particular operation. It also sorts the operations and standard procedures in each level. Currently, the algorithm is not recursive; it goes up to a depth of 3 levels. That is, it will only find 3 levels of sub-operations and then stop regardless if there are more sub-operations. To get to deeper levels, follow the pattern applied in this task and add more levels accordingly.
sortingSequences.xml
The webjects in this task create a group containing the sub-sequences and standard procedures found under a particular sequence. It also sorts the sequences and standard procedures in each level. Currently, the algorithm is not recursive; it goes up to a depth of 3 levels. That is, it will only find 3 levels of sub-sequences and then stop regardless if there are more sub-sequences. To get to deeper levels, follow the pattern applied in this task and add more levels accordingly.