A note on the complexity of the problem of two-agent scheduling on a single machine

@article{Ng2006ANO,
  title={A note on the complexity of the problem of two-agent scheduling on a single machine},
  author={C. T. Ng and T. C. Edwin Cheng and J. J. Yuan},
  journal={J. Comb. Optim.},
  year={2006},
  volume={12},
  pages={387-394}
}
We consider a two-agent scheduling problem on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the number of tardy jobs of the second agent cannot exceed a given number. It is reported in the literature that the complexity of this problem is still open. We show in this paper that this problem is NP-hard under high multiplicity encoding and can be solved in pseudopolynomial time under binary encoding. When the first agent… CONTINUE READING