175 search results - page 18 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
WSC
2000
13 years 9 months ago
2000
This paper presents the development and simulation of a novel Genetic Algorithm (GA) based methodology applied to optimal tuning of a fuzzy dispatching system for a fleet of autom...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
APPROX
2006
Springer
13 years 11 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...