Thèse de doctorat : Università della Svizzera italiana, 2010 ; 2010INFO003.
We study the approximability of scheduling problems in different contexts. We first give a short introduction to the field of scheduling theory and present a simple single machine scheduling problem that will form the base for all variants considered in the remainder of this thesis. We point out that this scheduling problem, though long known to be efficiently solvable in its original form,...
|