Publications

(2024). Evolving Scheduling Heuristics for Energy-Efficient Dynamic Workflow Scheduling in Cloud via Genetic Programming Hyper-heuristics. in Proceeding of International Conference on Intelligent Computing, 169–182.

PDF Cite DOI

(2024). Multi-Tree Genetic Programming Hyper-Heuristic for Dynamic Flexible Workflow Scheduling in Multi-Clouds. IEEE Transactions on Services Computing, 17(5), 2687–2703. [Selected as a Popular Paper in May 2024].

PDF Cite DOI

(2024). Virtual Machine Placement for Minimizing Image Retrieval Cost and Communication Cost in Cloud Data Center. IEEE Transactions on Network and Service Management, 21(2), 1998-2011.

PDF Cite DOI

(2023). Efficient, economical and energy-saving multi-workflow scheduling in hybrid cloud. Expert Systems with Applications, 228, 120401.

PDF Cite Code DOI

(2023). An Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container Cloud. in Proceeding of 16th Annual International Conference on Combinatorial Optimization and Applications, 168–181.

PDF Cite DOI

(2023). ET2FA: A Hybrid Heuristic Algorithm for Deadline-Constrained Workflow Scheduling in Cloud. IEEE Transactions on Services Computing, 16(3), 1807–1821. [Selected as a Popular Paper in October 2023].

PDF Cite DOI

(2022). EHEFT-R: multi-objective task scheduling scheme in cloud computing. Complex & Intelligent Systems, 8(6), 4475–4482.

PDF Cite DOI

(2021). T2FA: A Heuristic Algorithm for Deadline-Constrained Workflow Scheduling in Cloud with Multicore Resource. in Proceeding of IEEE 14th International Conference on Cloud Computing, 345–354.

PDF Cite DOI

(2019). Flower Pollination Algorithm Based on Block Structure Properties for Reentrant Job Shop Scheduling Problem. Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 55(16), 220–232.

PDF Cite DOI

(2018). Single-machine green scheduling to minimize total flow time and carbon emission. in Proceeding of International Conference on Intelligent Computing, 10954 LNCS, 670–678.

PDF Cite DOI

(2018). Salp swarm algorithm based on blocks on critical path for reentrant job shop scheduling problems. in Proceeding of International Conference on Intelligent Computing, 10954 LNCS, 638–648.

PDF Cite DOI