收录:
摘要:
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. © 2013 Operations Research Society of China, Periodicals Agency of Shanghai University, and Springer-Verlag Berlin Heidelberg.
关键词:
通讯作者信息:
电子邮件地址: