Sciweavers

517 search results - page 23 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
IPCO
1998
152views Optimization» more  IPCO 1998»
14 years 11 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
ICALP
2001
Springer
15 years 2 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
CAGD
2005
72views more  CAGD 2005»
14 years 9 months ago
Parametrization of approximate algebraic surfaces by lines
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
Sonia Pérez-Díaz, Juana Sendra, J. R...
ECRTS
2004
IEEE
15 years 1 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
DAM
2006
88views more  DAM 2006»
14 years 10 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo