Optimal Allocation of Workflow Resources with Cost Constraint

How to allocate workflow resources with cost constraint to optimize workflow time performance was studied. The average throughput time of workflow instances is used to measure the workflow time performance. A method based on queuing theory was proposed to calculate the average throughput time of workflow instances. Since the problem can be come down to an unbounded knapsack problem (UKP), an improved GA (genetic algorithm) suitable to solve the UKP was proposed to solve the problem. Examples were given to illustrate the feasibility and validity of the method. The results show that the algorithm has good evolution performance and can achieve or approach the optimal solutions. And compared with other allocation methods, our method performs best