393 search results - page 32 / 79 » Personnel scheduling: Models and complexity |
ANSS
2002
IEEE
15 years 4 months ago
2002
IEEE
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
ANCS
2007
ACM
15 years 3 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
AAAI
2004
15 years 1 months ago
2004
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
120
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...