The problem of scheduling tasks on a radar system can be modeled using coupled-tasks. We consider the case where all tasks are identical. This case raises original complexity questions and belongs to so-called high multiplicity scheduling problems. We present some complexity issues and results regarding the problem. We also describe a series of counter-examples showing that this problem is unlikely to be in NP.