Sciweavers

93 search results - page 11 / 19
» Non-clairvoyant scheduling with precedence constraints
Sort
View
AUSSOIS
2001
Springer
15 years 2 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
15 years 4 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
15 years 3 months ago
Power-aware scheduling of conditional task graphs in real-time multiprocessor systems
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
Dongkun Shin, Jihong Kim
COR
2007
106views more  COR 2007»
14 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
FLAIRS
2006
14 years 11 months ago
Incremental Propagation of Time Windows on Disjunctive Resources
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
Roman Barták