Online Scheduling With General Cost Functions
SIAM Journal on Computing(2014)
摘要
We consider a general online scheduling problem where the goal is to minimize Sigma(j) w(j)g(F-j), where w(j) is the weight/importance of job J(j), F-j is the flow time of the job in the schedule, and g is an arbitrary nondecreasing cost function. Numerous natural scheduling objectives are special cases of this general framework. We show that the scheduling algorithm Highest Density First (HDF) is (2 + epsilon)-speed O(1)-competitive for all cost functions g simultaneously. We give lower bounds that show that the HDF algorithm and this analysis are essentially optimal. Finally, we show that scalable algorithms are achievable in some special cases.
更多查看译文
关键词
online scheduling,simultaneous optimization,general cost functions,speed augmentation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络