Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems

被引:0
|
作者
Long Wan
Jin-Jiang Yuan
机构
[1] Jiangxi University of Finance and Economics,School of Information Technology
[2] Zhengzhou University,School of Mathematics and Statistics
关键词
Scheduling; Simultaneous approximation ratio; Global fairness; 90B35; 90C27;
D O I
暂无
中图分类号
学科分类号
摘要
Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment, we introduce in this paper the concepts of strong simultaneous approximation ratio and weak simultaneous approximation ratio. Then we study the two variants under various scheduling environments, such as non-preemptive, preemptive or fractional scheduling on identical, related or unrelated machines.
引用
收藏
页码:485 / 500
页数:15
相关论文
共 50 条