Sciweavers

2714 search results - page 51 / 543
» Approximation Schemes for Scheduling
Sort
View
92
Voted
WICOMM
2010
69views more  WICOMM 2010»
14 years 10 months ago
Per-user service model for opportunistic scheduling scheme over fading channels
Mehrdad Dianati, Rahim Tafazolli, Xuemin Shen, Ksh...
ORL
2008
112views more  ORL 2008»
15 years 3 months ago
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, St...
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 5 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
122
Voted
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
14 years 10 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle