Indexed by：
Abstract：
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.
Keyword：
Reprint Author's Address：
Email：
Source ：
Journal of the Operations Research Society of China
ISSN： 2194-668X
Year： 2013
Issue： 1
Volume： 1
Page： 159-161
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
