Title of article
Batch scheduling and common due date assignment problem: An NP-hard case
Author/Authors
Mikhail Y. Kovalyov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
251
To page
254
Abstract
An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal set-up times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness.
Keywords
Scheduling , Due date assignment , Computational complexity , Batching
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884679
Link To Document