175 search results - page 15 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
139
click to vote
UAI
1998
15 years 4 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
113
click to vote
MICRO
1990
IEEE
15 years 7 months ago
1990
IEEE
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
120
click to vote
DFG
2009
Springer
15 years 9 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
116
click to vote
ICTCS
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
121
click to vote
SIAMDM
2002
15 years 2 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...