Title of article
On scheduling unbounded batch processing machine(s)
Author/Authors
L.L. Liu، نويسنده , , C.T. Ng، نويسنده , , *، نويسنده , , T.C.E. Cheng a، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
4
From page
814
To page
817
Abstract
The computational complexity of scheduling jobs with released dates on an unbounded batch processing
machine to minimize total completion time and on parallel unbounded batch processing machines to
minimize total weighted completion time remains open. In this note we show that the first problem is
NP-hard with respect to id-encoding, and the second one is strongly NP-hard.
Keywords
Scheduling , Batch processing , Computational complexity
Journal title
Computers & Industrial Engineering
Serial Year
2010
Journal title
Computers & Industrial Engineering
Record number
925904
Link To Document