摘要
In this note,we provide an almost tight lower bound for the scheduling problem to meet two min-sum objectives considered by Angel et al.in Oper.Res.Lett.35(1):69–73,2007.
基金
supported by National Science and Engineering Research Council of Canada(No.283106)
Scientific Research Common Program of Beijing Municipal Commission of Education(No.KM201210005033).
