A polynomial time approximation scheme for the single machine total completion time scheduling problem with availability constraints

Julien Moncel (1) , Jérémie Thiery (1) , Ariel Waserhole (1)

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

In this paper, we study the single machine total completion time scheduling problem with availability constraints. This problem is known to be NP-complete. Sadfi et al gave an approximation algorithm with relative error 3/17. The main contribution of this paper is a polynomial time approximation scheme for this problem. Our scheme is a simple generalization of the algorithm proposed by Sadfi et al.

Mots clés: scheduling; approximation algorithm; availability constraints

Domaines: Mathématique discrète [cs.DM]

Julien Moncel, Jérémie Thiery, Ariel Waserhole. A polynomial time approximation scheme for the single machine total completion time scheduling problem with availability constraints. 2007. ⟨hal-00181166⟩