Scheduling dependent coflows to minimize the total weighted job completion time in datacenters - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Bingchuan Tian, Chen Tian, Bingquan Wang, Bo Li, Zehao He, Haipeng Dai, Kexin Liu, Wanchun Dou, Guihai Chen. Scheduling dependent coflows to minimize the total weighted job completion time in datacenters. Computer Networks, 158:193-205, 2019. [doi]

The following publications are possibly variants of this publication:

Minimizing Total Completion Time Subject to Job Release Dates and Preemption PenaltiesZhaohui Liu, T. C. Edwin Cheng. scheduling, 7(4):313-327, 2004. [doi]

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobsRubing Chen, Jinjiang Yuan, Yuan Gao. scheduling, 22(5):581-593, 2019. [doi]

A note on minimizing total weighted completion time with an unexpected machine unavailable intervalPeihai Liu, Chao Wang, Xiwen Lu. scheduling, 22(2):255-262, 2019. [doi]

Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteriaYunqiang Yin, Youhua Chen, Kaida Qin, Dujuan Wang. scheduling, 22(3):315-333, 2019. [doi]

On scheduling with non-increasing time slot cost to minimize total weighted completion timeYingchao Zhao, Xiangtong Qi, Minming Li. scheduling, 19(6):759-767, 2016. [doi]

runs on WebDSL