Title of article :
A note on the maximum number of on-time jobs on parallel identical machines
Author/Authors :
Avital Lann، نويسنده , , Gur Mosheiov، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Pages :
5
From page :
1745
To page :
1749
Abstract :
This note addresses the scheduling problem of minimizing the number of on-time jobs. We introduce an efficient View the MathML source solution algorithm for the problem on parallel identical machines.
Keywords :
Parallel identical machines , Scheduling , Earliness–tardiness cost
Journal title :
Computers and Operations Research
Serial Year :
2003
Journal title :
Computers and Operations Research
Record number :
927439
Link To Document :
بازگشت