554 search results - page 34 / 111 » Approximability of OFDMA Scheduling |
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
CLUSTER
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
ANOR
2010
14 years 7 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
EOR
2010
14 years 7 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...