Parameterized complexity of a coupled-task scheduling problem