Sciweavers

65 search results - page 3 / 13
» Layer-Based Scheduling Algorithms for Multiprocessor-Tasks w...
Sort
View
ICALP
2001
Springer
13 years 10 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
ICTAI
2006
IEEE
13 years 11 months ago
Incremental Filtering Algorithms for Precedence and Dependency Constraints
Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the...
Roman Barták, Ondrej Cepek
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 7 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
ATAL
2003
Springer
13 years 11 months ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 7 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