A note on scheduling to meet two min-sum objectives

Eric Angel (1) , Evripidis Bampis (1) , Aleksei V. Fishkin (2)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 MPII - Max-Planck-Institut für Informatik

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1 + (1/γ), 1 + γ)-approximation algorithm, and show that for y > 1, there is no (x, y)-approximation with 1 < x < 1 + (1/γ) and 1 < y < 1 + (γ - 1)/(2 + y).

Mots clés: Completion time; Approximation algorithm; Polynomial time; Objective function; Single machine; Scheduling

Domaines: Informatique; Recherche opérationnelle [math.OC]; Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Informatique et théorie des jeux [cs.GT]

Eric Angel, Evripidis Bampis, Aleksei V. Fishkin. A note on scheduling to meet two min-sum objectives. Operations Research Letters, 2007, 35 (1), pp.69--73. ⟨hal-00341342⟩