Sciweavers

10 search results - page 2 / 2
» Resource Constraints for Preemptive Job-shop Scheduling
Sort
View
AAAI
2000
15 years 1 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CPAIOR
2007
Springer
15 years 5 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
FMSD
2007
133views more  FMSD 2007»
14 years 11 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
RTSS
1998
IEEE
15 years 3 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros
RTSS
1999
IEEE
15 years 4 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros