مرکز منطقه ای اطلاع رساني علوم و فناوري - Randomized algorithms for on-line scheduling problems: how low canʹt you go?

Title of article :

Randomized algorithms for on-line scheduling problems: how low canʹt you go?

Author/Authors :

Leen Stougie، نويسنده , , Arjen P.A. Vestjens، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 2002

Pages :

From page :

To page :

Keywords :

competitive analysis , On-line scheduling , Randomized algorithm

Journal title :

Operations Research Letters

Serial Year :

2002

Journal title :

Operations Research Letters

Record number :

137349

Link To Document :