15 search results - page 1 / 3 » Improved Results for Data Migration and Open Shop Scheduling |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
ICALP
2009
Springer
14 years 5 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...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
CCGRID
2008
IEEE
13 years 11 months ago
2008
IEEE
In this work we examine a task scheduling and data migration problem for Grid Networks, which we refer to as the Data Consolidation (DC) problem. DC arises when a task needs for i...
AUSAI
2005
Springer
13 years 10 months ago
2005
Springer
This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into l...