109 search results - page 11 / 22 » Convex programming for scheduling unrelated parallel machine... |
120
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
112
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
119
click to vote
CLUSTER
2009
IEEE
15 years 5 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...
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
110
click to vote
WINE
2009
Springer
15 years 8 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...