Indexed on: 20 Dec '18Published on: 17 Dec '18Published in: Journal of Scheduling
In this paper, we revisit a two-agent scheduling problem on a single machine. In this problem, we have two competing agents A and B, which means that the job set of agent A and the job set of agent B are disjoint. The objective is to minimize the total completion time of agent A, under the constraint that the total number of tardy jobs of agent B is no larger than a given bound. The complexity of this problem was posed as open in Agnetis et al. (Oper Res 52:229–242, 2004). Leung et al. (Oper Res 58:458–469, 2010a, b. https://doi.org/10.1287/opre.1090.0744ec) showed that the problem is binary NP-hard. However, their NP-hardness proof has a flaw. Here, we present a new NP-hardness proof for this problem. Our research shows that the problem is still NP-hard even if the jobs of agent A have a common processing time.