Sciweavers

93 search results - page 4 / 19
» Non-clairvoyant scheduling with precedence constraints
Sort
View
RTCSA
2008
IEEE
14 years 4 days ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
ORL
2008
112views more  ORL 2008»
13 years 5 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
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...
COR
2010
121views more  COR 2010»
13 years 5 months ago
Parallel machine scheduling with precedence constraints and setup times
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
Bernat Gacias, Christian Artigues, Pierre Lopez
SODA
2008
ACM
76views Algorithms» more  SODA 2008»
13 years 7 months ago
Non-clairvoyant scheduling with precedence constraints
Julien Robert, Nicolas Schabanel