109 search results - page 5 / 22 » Convex programming for scheduling unrelated parallel machine... |
102
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
IJMTM
2011
14 years 6 months ago
2011
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
CCGRID
2002
IEEE
15 years 4 months ago
2002
IEEE
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
JCO
1998
14 years 11 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
103
click to vote
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...