Title of article
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
Author/Authors
C. T. Ng، نويسنده , , T. C. E. Cheng، نويسنده , , J. J. Yuan، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2002
Pages
5
From page
187
To page
191
Keywords
Scheduling , Single machine multi-operation jobs
Journal title
Information Processing Letters
Serial Year
2002
Journal title
Information Processing Letters
Record number
129512
Link To Document