40 search results - page 3 / 8 » New hardness results for congestion minimization and machine... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
RANDOM
1999
Springer
14 years 23 days ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ECMDAFA
2005
Springer
14 years 2 months ago
2005
Springer
The model-driven software development for hard real-time systems promotes the usage of the platform independent model as major design artifact. It is used to develop the software l...