160 search results - page 7 / 32 » A General Buffer Scheme for the Windows Scheduling Problem |
102
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
RTCSA
2000
IEEE
15 years 4 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
138
click to vote
RSP
1998
IEEE
15 years 4 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...
AIR
2004
14 years 11 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...