首页|Online uniform machine covering with the known largest size
Online uniform machine covering with the known largest size
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
This paper investigates the semi-online scheduling problem with the known largest size on two uniform machines. The objective is to maximize the minimum machine completion time. Both lower bounds and algorithms are given. Algorithms are optimal forthe majority values of s ≥ 1, where s is the speed ratio of the two machines. The largest gap between the competitive ratio and the lower bound is about 0.064. Moreover, the overall competitive ratio 2 matches the overall lower bound.
scheduling and coveringuniform machinedesign and analysis of algorithmonlinecompetitive ratio
Cao Shunjuan、Tan Zhiyi
展开 >
Department of Mathematics, Zhejiang University, Hangzhou 310027, China
2007
Progress in Natural Science: Communication of State Key Laboratories of China
NETL
NSTL
