Skip to Main Content
In this paper we prove that the problem of scheduling jobs with incompatible job families on a single batch processing machine to minimize number of tardy jobs is strongly (unary) NP-hard. We then develop a dynamic programming algorithm for minimizing weighted number of tardy jobs on a single batch processing machine with incompatible job families.
Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on (Volume:3 )
Date of Conference: 3-4 Aug. 2008