مرکز منطقه ای اطلاع رساني علوم و فناوري - Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Title of article :

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Author/Authors :

J. A. Hoogeveen، نويسنده , , S. L. van de Velde، نويسنده ,

Issue Information :

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

Pages :

From page :

205

To page :

208

Keywords :

Smgle-machme schedulmg , BlCntcna schcdulll1g , rotal compicuon lIme , Maximum cost , Maximum lateness

Journal title :

Operations Research Letters

Serial Year :

1995

Journal title :

Operations Research Letters

Record number :

136961

Link To Document :