3563 search results - page 220 / 713 » Scheduling Algorithms for Procrastinators |
132
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
145
click to vote
IOR
2007
15 years 4 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
120
Voted
ORL
1998
15 years 4 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
133
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
119
click to vote
DAM
2007
15 years 4 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...