393 search results - page 9 / 79 » Personnel scheduling: Models and complexity |
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
— Typical embedded systems must perform rather complex control and communication tasks with severely restricted computing resources. Due to these contraints most systems are sing...
RTAS
2005
IEEE
15 years 5 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
102
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
EMSOFT
2001
Springer
15 years 4 months ago
2001
Springer
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...