| 摘要 |
PROBLEM TO BE SOLVED: To flexibly cope with requests of moving-up of a schedule, agent designation, etc., by freely combining various work flow replanning algorithms. SOLUTION: If the predicted end time of each unit work is behind the closing time of a unit work designated in work flow definition, a completion time predicting means 111 transfers the identification name of a node which cannot be punctual to a replanning means 113. A definition analysis means 114 receives the work flow definition and analyzes application sequence descriptions of replanning algorithms included there and transfers them to the replanning means 113. The replanning means 113 received analyzed replanning definition descriptions from the definition analysis means 114 and receives and applies replanning algorithms from a replanning algorithm library 115 in accordance with the application sequence; and if any algorithm is successful, a work flow operation change means 106 is instructed to change the operation based on a new work flow plan. However, if a report algorithm is applied, this application is reported to amanager. |
