Identical coupled task scheduling: polynomial complexity of the cyclic case

Vassilissa Lehoux-Lebacque (1) , Nadia Brauner (1) , Gerd Finke (1)

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production

Coupled task problems arise in connection with radar systems. For the transmission and reception of an electromagnetic pulse the radar (the processor) has to execute two tasks that are separated by some fixed time interval. Most of the complexity issues for scheduling a set of such pairs of two-operation tasks have been settled. However, the complexity status is still unknown for the identical coupled task problem, where multiple copies of a single coupled task are to be processed. The purpose of this article is prove the polynomial complexity of this problem in the cyclic case.

Domaines: Recherche opérationnelle [math.OC]

Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke. Identical coupled task scheduling: polynomial complexity of the cyclic case. 2009. ⟨hal-00392744⟩