A path relinking enhanced estimation of distribution algorithm for direct acyclic graph task scheduling problem

作者：

Highlights：

• Direct acyclic graph task scheduling problem is studied.

• Path relinking enhanced estimation of distribution algorithm is proposed.

• Hybrid decoding scheme is designed by integrating four list based heuristics.

• Effectiveness is demonstrated by statistical comparisons.

摘要

•Direct acyclic graph task scheduling problem is studied.•Path relinking enhanced estimation of distribution algorithm is proposed.•Hybrid decoding scheme is designed by integrating four list based heuristics.•Effectiveness is demonstrated by statistical comparisons.

论文关键词：Estimation of distribution algorithm,Direct acyclic graph task scheduling,Path relinking,Makespan,Workflow scheduling

论文评审过程：Received 22 November 2020, Revised 22 June 2021, Accepted 24 June 2021, Available online 25 June 2021, Version of Record 30 June 2021.

论文官网地址：https://doi.org/10.1016/j.knosys.2021.107255