Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs

• DOI: 10.1007/s10878-019-00407-z
• Publication Date: 2019-04-08T06:02:41Z
• Authors: Yuan Gao; Jinjiang Yuan
• Keywords: Theory of computation; Job queue; Polynomial-time approximation scheme; Batch processing

We study the unbounded parallel-batch scheduling problem with the jobs having agreeable release dates and processing times to minimize the total weighted number of tardy jobs. In this problem, we consider two types of jobs: batch jobs and drop-line jobs. For batch jobs, the completion time of a job is given by the completion time of the batch containing this job. For drop-line jobs, the completion time of a job is given by the starting time of the batch containing this job plus the processing time of this job. For both of batch jobs and drop-line jobs, we show that (1) the problems are binary NP-hard, (2) the problems are solvable in pseudo-polynomial times, and when the number of weights is a constant, the problems are solvable in polynomial times, and (3) the problems have a fully polynomial-time approximation scheme.