Scheduling Workflow Tasks With Unknown Task Execution Time by Combining Machine-Learning and Greedy-Optimization

Thumbnail Image
File version

Accepted Manuscript (AM)

Yang, Y
Shen, H
Tian, H
Griffith University Author(s)
Primary Supervisor
Other Supervisors
File type(s)

Workflow tasks are time-sensitive and their task completion utility, i.e., value of task completion, is inversely proportional to their completion time. Existing solutions to the NP-hard problem of utility-maximization task scheduling were achieved under the assumptions of linear Time Utility Function (TUF), i.e., utility is inversely proportional to completion time following a linear function, and prior knowledge of task execution time, which is unrealistic for many applications and dynamic systems. This paper proposes a novel model of combining greedy optimization with machine learning for scheduling time-sensitive tasks with convex TUF and unknown task execution time on heterogeneous cloud servers offline nonpreemptively to maximize the total utility of input tasks. For a set of time-sensitive tasks with data dependencies, we first employ multi-layer perceptron neural networks to predict task execution time by utilizing historical data. Then, by solving a linear program after relaxing the disjunctive constraint introduced by the nonpreemption requirement to calculate maximum utility increment, we propose a novel greedy algorithm of marginal incremental utility maximization that jointly determines the task-to-processor allocation plan and tasks' execution sequence on each processor. We then show that our algorithm has an expected approximation ratio of (e−1)(τ−2)eτ for convex TUF and e−13e≈0.21 for linear TUF, where τ is the ratio of total completion utility over total delay cost under optimal scheduling. Our result presents the first polynomial-time approximation solution for this problem that achieves a performance guarantee of bounded ratio for convex TUF and constant ratio for linear TUF respectively. Extensive experiment results through both simulation and real cloud implementation demonstrate significant performance improvement of our algorithm over the known results.

Journal Title

IEEE Transactions on Services Computing

Conference Title
Book Title
Thesis Type
Degree Program
Publisher link
Patent number
Grant identifier(s)
Rights Statement
Rights Statement

This work is covered by copyright. You must assume that re-use is limited to personal use and that permission from the copyright owner must be obtained for all other uses. If the document is available under a specified licence, refer to the licence for details of permitted re-use. If you believe that this work infringes copyright please make a copyright takedown request using the form at

Item Access Status

This publication has been entered in Griffith Research Online as an advance online version.

Access the data
Related item(s)

Distributed computing and systems software

Information systems

Persistent link to this record

Yang, Y; Shen, H; Tian, H, Scheduling Workflow Tasks With Unknown Task Execution Time by Combining Machine-Learning and Greedy-Optimization, IEEE Transactions on Services Computing, 2024