Complexity and approximation for scheduling problem for a torpedo

@article{Simonin2009ComplexityAA,
  title={Complexity and approximation for scheduling problem for a torpedo},
  author={Gilles Simonin and Rodolphe Giroudeau and Jean-Claude K{\"o}nig},
  journal={2009 International Conference on Computers & Industrial Engineering},
  year={2009},
  pages={300-304}
}
This paper considers a special case of the coupled-tasks scheduling problem on one processor. The general problems were analyzed in depth by Orman ad Potts [1]. In this paper, we cosider that all processing times are equal to 1, the gap has exact length L, we have precedence constraits, compatibility constraits are introduced and the criterion is to minimize the scheduling length. We use this problem to study the problem of data acquisittion and data treatment of a torpedo under the water. We… CONTINUE READING