1536 search results - page 203 / 308 » DPS - Dynamic Parallel Schedules |
112
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
140
click to vote
CLUSTER
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Since the advent of multi-core processors, the physionomy of typical clusters has dramatically evolved. This new massively multi-core era is a major change in architectu...
136
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
137
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
116
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...