مرکز منطقه ای اطلاع رساني علوم و فناوري - Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

Title of article :

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

Author/Authors :

F. Della Croce، نويسنده , , V. Tʹkindt، نويسنده ,

Issue Information :

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

Pages :

From page :

142

To page :

148

Keywords :

Single machine scheduling , lower bound , preemption , Total completion time

Journal title :

Operations Research Letters

Serial Year :

2003

Journal title :

Operations Research Letters

Record number :

137413

Link To Document :