Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor

@article{Simonin2011IsomorphicCS,
  title={Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor},
  author={Gilles Simonin and Beno{\^i}t Darties and Rodolphe Giroudeau and Jean-Claude K{\"o}nig},
  journal={J. Scheduling},
  year={2011},
  volume={14},
  pages={501-509}
}
The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled-tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled-task is equal to the sum of its two sub-tasks. We prove NP-completeness of the minimization of the… CONTINUE READING