Title of article :
A lower bound for on-line scheduling on uniformly related machines
Author/Authors :
Leah Epstein، نويسنده , , Ji ? Sgall، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2000
Keywords :
On-line scheduling , preemption , Uniformly related machines
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters