Skip to Main Content
In this paper we consider the problem of scheduling jobs with and without release dates on parallel unbounded batch processing machines to minimize total completion time. We show that the problem with release dates is strongly NP-hard by a reduction from the strongly NP-hard 3-Partition problem and develop a dynamic programming algorithm for the problem without release dates.
Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on (Volume:1 )
Date of Conference: 8-9 Aug. 2009