Multi-Objective Multi-Stage Optimize Scheduling Algorithm for Nonlinear Virtual Work-Flow Based on Pareto

Abstract

Work-flow scheduling is for finding the allocation method to achieve optimal resource utilization. In the scheduling process, constraints, such as time, cost and quality, need to be considered. How to balance these parameters is a NP-hard problem, and the nonlinear manufacturing process increases the difficulty of scheduling, so it is necessary to provide an effective heuristic algorithm. Aiming at these problems, a multi-objective nonlinear virtual work-flow model was set up, and a multi-objective staged scheduling optimization algorithm with the objectives of minimizing cost and time and maximizing quality was proposed. The algorithm includes three phases: the virtualization phase abstracts tasks and services into virtual nodes to generate a virtual work-flow model; the virtual scheduling phase divides optimized segments and obtains the solution set through reverse iteration; the generation phase obtains the scheduling path according to the Pareto dominance. The proposed algorithm performed 10.5% better in production quality than the minimum critical path algorithm, reduced the time to meet the time constraint by 9.1% and saves 13.7% more of the cost than the production accuracy maximization algorithm.