We consider the single-machine scheduling problem to minimize the weighted sum of completion times under precedence constraints. In a series of recent papers, it was established that this scheduling… (More)

In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design… (More)

In this paper we survey recent results on the precedence constraint single machine scheduling problem to minimize the weighted sum of completion times. We show how we can benefit from known results… (More)

In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design… (More)

We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation algorithms is considered one… (More)

This thesis studies the approximability of scheduling problems in different contexts. Chapter 2 gives a short introduction to the field of scheduling theory and presents a simple single machine… (More)

In this paper we deal with the following natural family of geometric matching problems. Given a class C of geometric objects and a point set P , a C-matching is a set M ⊆ C such that every C ∈ M… (More)