研究了成本约束条件下协调工作流活动对资源数量的使用,以减少整个工作流系统执行时间。该问题可归纳为多选择背包问题,并设计了资源数量优化算法来满足成本约束,算法的目标是在该约束下最小化工作流系统关键路径的执行时间。最后通过实例测试了算法的有效性和正确性。
The optimal workflow resource allocation to reduce workflow average execution time was studied to coordinate the number of resources to meet the cost constraints. This problem was modeled as Multiple Choice Knapsack Problem (MCKP). A resource allocation optimization algorithm under cost constraints was designed. It was aimed to minimize the average execution time of the critical path of workflow under the constraints. An example verified the effectiveness and correctness of this algorithm.